蔗糖生产计划模型内点算法仿真计算结果(n = 60, m = 10, T = 12, t = 2 h, k = T/t = 6)
决策变量	1-2	3-4	5-6	7-8	9-10	11-12	剩余时间限制(每车开始加工必须为剩余时间的前2 h)
货车编号	时段1	时段2	时段3	时段4	时段5	时段6	决策变量	≤	剩余时间(h)	损失率%	实际损失时间(h)
1	0	0	0	1	0	0	8	≤	8	30	6
2	0	0	1	0	0	0	6	≤	6	28	4
3	0	1	0	0	0	0	4	≤	4	19	2
4	0	0	0	1	0	0	8	≤	22	48	6
5	1	0	0	0	0	0	2	≤	10	62	0
6	0	1	0	0	0	0	4	≤	16	54	2
7	0	0	0	1	0	0	8	≤	8	25	6
8	0	0	0	1	0	0	8	≤	8	27	6
9	0	0	1	0	0	0	6	≤	6	37	4
10	0	1	0	0	0	0	4	≤	4	26	2
11	0	0	0	1	0	0	8	≤	8	43	6
12	0	0	1	0	0	0	6	≤	6	45	4
13	1	0	0	0	0	0	2	≤	20	60	0
14	0	1	0	0	0	0	4	≤	4	25	2
15	0	0	0	1	0	0	8	≤	8	38	6
16	1	0	0	0	0	0	2	≤	10	60	0
17	0	0	0	0	1	0	10	≤	20	45	8
18	0	0	0	0	0	1	12	≤	18	26	10
19	0	0	0	0	0	1	12	≤	16	28	10
20	0	1	0	0	0	0	4	≤	8	54	2
21	0	0	1	0	0	0	6	≤	6	48	4
22	0	0	0	0	1	0	10	≤	16	46	8
23	0	1	0	0	0	0	4	≤	4	40	2
24	0	0	0	0	0	1	12	≤	12	25	10
25	0	0	0	0	1	0	10	≤	10	20	8
26	0	0	0	1	0	0	8	≤	8	38	6
27	0	0	1	0	0	0	6	≤	6	42	4
28	0	0	0	0	1	0	10	≤	10	25	8
29	0	0	0	0	0	1	12	≤	14	28	10
30	0	0	0	0	0	1	12	≤	16	30	10
31	0	0	0	0	1	0	10	≤	22	43	8
32	0	1	0	0	0	0	4	≤	4	26	2
33	0	0	1	0	0	0	6	≤	6	37	4
34	0	0	0	1	0	0	8	≤	8	28	6
35	0	0	0	0	0	1	12	≤	18	13	10
36	1	0	0	0	0	0	2	≤	20	54	0
37	1	0	0	0	0	0	2	≤	4	60	0
38	0	0	1	0	0	0	6	≤	16	50	4
39	0	0	0	0	1	0	10	≤	10	37	8
40	0	0	0	0	1	0	10	≤	14	43	8
41	1	0	0	0	0	0	2	≤	24	55	0
42	0	0	0	0	0	1	12	≤	16	35	10
43	0	0	0	1	0	0	8	≤	8	30	6
44	1	0	0	0	0	0	2	≤	6	54	0
45	0	0	1	0	0	0	6	≤	12	50	4
46	0	0	0	0	1	0	10	≤	16	40	8
47	0	1	0	0	0	0	4	≤	4	32	2
48	0	0	0	1	0	0	8	≤	8	30	6
49	0	0	0	0	1	0	10	≤	10	28	8
50	0	0	0	0	0	1	12	≤	16	36	10
51	0	0	0	0	0	1	12	≤	18	38	10
52	0	1	0	0	0	0	4	≤	4	40	2
53	0	0	0	0	1	0	10	≤	20	42	8
54	0	1	0	0	0	0	4	≤	4	40	2
55	0	0	1	0	0	0	6	≤	8	50	4
56	1	0	0	0	0	0	2	≤	6	56	0
57	1	0	0	0	0	0	2	≤	2	60	0
58	1	0	0	0	0	0	2	≤	4	64	0
59	0	0	1	0	0	0	6	≤	10	48	4
60	0	0	0	0	0	1	12	≤	12	38	10
每个时段最多允许 10辆	10	10	10	10	10	10	内点算法求解总迭代次数249次，总目标最小损失费为15,154元。
	≤	≤	≤	≤	≤	≤
	10	10	10	10	10	10