还剩15页未读,继续阅读
本资源只提供10页预览,全部文档请下载后查看!喜欢就下载吧,查找使用更方便
文本内容:
实舲赧告姓名:IWJ志通学号20120404302班级信息与计算科学1203指导老师武梦梦START
20.
0000000.000000START
30.
0000000.000000START
44.
0000000.000000START
516.
000000.000000START
60.
0000000.000000START
70.
0000000.000000START
80.
0000000.000000Row Slack or SurplusDual Price
146.00000-
1.
00000020.000000-
1.
00000030.
0000000.
00000048.
0000000.
00000054.
0000000.
00000060.000000-
1.
000000714.
000000.
000000810.
000000.
000000914.
000000.000000答第时段安排人,第、时段不增加人,第时段安排再人,第时段12623445再安排人,总共至少安排服务员人1646实验指派问题4已知如下效率矩阵,求极大化指派问题Bi B2B B4B53Ai4871512A279171410A3691287A46714610A5691216⑴给出原始代码;sets:AD/A
1..A5/:A;BD/B
1..B5/:B;linkAD,BD:c,x;endsetsdata:c=48715127917141069128767146106912106;enddatamax=@sumlinkij:cij*xij;@forBDj:@sumADi:xiJ=l;@forADi:@sumBDj:xiJ=l;@forlink:@binx;2计算结果决策变量求解结果粘贴Global optimalsolution found.Objective value:
57.00000Objective bound:
57.00000Infeasibilities:
0.000000Extended solversteps:0Total solveriterations:0Variable A A4Reduced CostA Al Value
0.000000A A
20.
0000000.000000AA
30.
0000000.
0000000.
0000000.
0000000.000000AA
50.
0000000.000000B Bl
0.
0000000.000000BB
20.
0000000.000000BB
30.
0000000.000000BB
40.
0000000.000000BB
50.
0000000.000000C Al,Bl
4.
0000000.000000C Al,B
28.
0000000.000000C Al,B
37.
0000000.000000C Al,B
415.
000000.000000C Al,B
512.
000000.000000C A2,Bl
7.
0000000.000000C A2,B
29.
0000000.000000C A2,B
317.
000000.000000C A2,B
414.
000000.000000C A2,B
510.
000000.000000C A3,Bl
6.
0000000.000000C A3,B
29.
0000000.000000C A3,B
312.
000000.000000C A3,B
48.
0000000.000000C A3,B
57.
0000000.000000C A4,Bl
6.
0000000.000000C A4,B
27.
0000000.000000C A4,B
314.
000000.000000C A4,B
46.
0000000.000000C A4,B
510.
000000.000000C A5,Bl
6.
0000000.000000C A5,B
29.
0000000.000000C A5,B
312.
000000.000000C A5,B
410.
000000.000000C A5,B
56.
0000000.000000X Al,Bl
0.000000-
4.000000X Al,B
20.000000-
8.000000X Al,B
30.000000-
7.000000X Al,B
41.000000-
15.00000X Al,B
50.000000-
12.00000X A2,Bl
0.000000-
7.000000X A2,B
20.000000-
9.000000X A2,B
31.000000-
17.00000X A2,B
40.000000-
14.00000X A2,B
50.000000-
10.00000X A3,Bl
0.000000-
6.000000X A3,B
21.000000-
9.000000X A3,B
30.000000-
12.00000X A3,B
40.000000-
8.000000X A3,B
50.000000-
7.000000X A4,Bl
0.000000-
6.000000X A4,B
20.000000-
7.000000X A4,B
30.000000-
14.00000X A4,B
40.000000-
6.000000X A4,B
51.000000-
10.00000X A5,Bl
1.000000-
6.000000X A5,B
20.000000-
9.000000X A5,B
30.000000-
12.00000X A5,B
40.000000-
10.00000X A5,B
50.000000-
6.000000Row Slackor SurplusDual Price
157.
000001.
00000020.
0000000.
00000030.
0000000.
00000040.
0000000.
00000050.
0000000.
00000060.
0000000.
00000070.
0000000.
00000080.
0000000.
00000090.
0000000.
000000100.
0000000.
000000110.
一、实验性质和教学目的本实验是运筹学课内安排的上机操作实验目的在于了解、熟悉计算机软件在运筹学模型求解中的作用,激发学习兴趣,提Lingo高学习效果,增强自身的动手能力,提高实际应用能力二实验基本要求要求学生实验前认真做好理论准备,仔细阅读实验指导书;
1.遵从教师指导,认真完成实验任务,按时按质提交实验报告
2.三主要参考资料软件
1.LINGO,优化建模与软件,清华大学出版社,3LINDO/LINGO2005运筹学编写组主编,运筹学(第四版),清华大学出版社,
4.2012胡运权主编,运筹学教程(第二版),清华大学出版社,
5.2003实验线性规划问题1max z=4X]+3x29x,+812X27x+1lx24s.tAi2+1lx132,x021给出原始代码;max4x1+3x2st9xl+8x2127x1+1lx2249xl+llx213end2计算结果包括灵敏度分析,求解结果粘贴;Global optimalsolution found.Objective value:
5.333333Infeasibilities:
0.000000Variable Value Reduced CostXI
1.
3333330.000000X
20.
0000000.5555556Total solveriterations:2Row Slackor SurplusDual Price
15.
3333331.
00000020.
0000000.
4444444314.
666670.
00000041.
0000000.000000Ranges inwhich thebasis isunchanged:ObjActive CcafficiantRangesCurrent AllowableAllowableVariable CoefficientIncrease DecreaseXI
4.000000INFINITY
0.6250000X
23.
0000000.5555556INFINITYRighthand SideRangesRow CurrentAllowable AllowableRHSIncrease Decrease
212.
000001.
00000012.
00000324.00000INFINITY
14.
66667413.00000INFINITY
1.000000
(3)回答下列问题(手写):a)最优解及最优目标函数值是多少;答最优解最优目标函数值Xl=l.333333X2=
0.000000=
5.333333b)资源的对偶价格各为多少,并说明对偶价格的含义;答对偶价格的含义表示每yl=
0.4444444;y2=
0.000000;y3=
0.000000;增加一个单位(约束右边的常数),目标值改变的数量(在最大化问题中目标函数值是增加,在最小化问题中目标函数值是减少)c)为了使目标函数值增加最多,让你选择一个约束条件,将它的常数项增加一个单位,你将选择哪一个约束条件?这时目标函数值将是多少答选择第一个约束条件,若常数项增加一个单位,目标函数值将=
5.77777d)对x2的目标函数系数进行灵敏度分析;答目标函数中变量原来的费用系数为允许增加、x23,(Allowable Increase)=
0.5555556允许减少说明当它在(Allowable Decrease)=INFINITY,[3-8,3+
0.5555556]=[2,
3.5555556]范围变化时,最优基保持不变e)对第2个约束的约束右端项进行灵敏度分析;答当它在8〕范围变化时,最优基保持不变[24-
14.66667,24+8]=[
9.33333,f)结合本题的结果解释“Reduced Cost”的含义答指为了使某个变量在解中的数值增加一个单位,目标函数值必须付出Reduced Cost的代价在本题中的值为当增加一个单位时,目标函数值将不变xl Reduced Cost0,xl的值为即当增加一个单位时,目标函数值将减少x2ReducedCost
0.5555556,x
20.5555556;实验运输问题2如下是一个最小费用运输问题产销量及单位运价如下表数据仓库WH1WH2WH3WH4WH5WH6供应量605551434152数据二:供应商VI V2V3V4V5V6V7V8需求量3537223241324338数据三:VI VI VI VI VIVIVIVI62674259WH1WH236538982WH376157433WH452739271WH523955265WH6572231431给出原始代码;Sets:warehouse/
1..6/:WH;customer/
1..8/:V;routeswarehouse,customer:c,x;endsetsdata:WH=60,55,51,43,41,52;V=35,37,22,32,41,32,43,38;c=6,2,6,7,4,2,5,9,3,6,5,3,8,9,827,6,157,4,3,3,5,2,7,3,927,1,239,552,6,5,5,7,2,231,4,3;enddata[obj]min=@sumroutes:c*x;@forwarehousei:[sup]@sumcustomerj:xiJ=WHi;@forcustomerj:[dem]@sumwarehousei:xij=Vj;end⑵计算结果(决策变量求解结果粘贴)Global optimalsolution found.
634.0000Objective value:
0.000000Infeasibilities:16Total solveriterations:ValueReducedCostVariable
60.
000000.000000WH
155.
000000.000000WH
251.
000000.000000WH
343.
000000.000000WH
441.
000000.000000WH
552.
000000.000000WH
635.
000000.000000V
137.
000000.000000V
222.
000000.000000V
332.
000000.000000V
441.
000000.000000V
532.
000000.000000V
643.
000000.000000V
738.
000000.000000V
86.
0000000.000000C1,
12.
0000000.000000C1,
26.
0000000.000000C1,
37.
0000000.000000C1,
44.
0000000.000000C1,
52.
0000000.000000C1,
65.
0000000.000000C1,
79.
0000000.000000C1,
83.
0000000.000000C2,
16.
0000000.000000C2,
25.
0000000.000000C2,
33.
0000000.000000C2,
48.
0000000.000000C2,
59.
0000000.000000C2,
68.
0000000.000000C2,
72.
0000000.000000C2,
87.
0000000.000000C3,
16.
0000000.000000C3,
21.
0000000.000000C3,
35.
0000000.000000C3,
47.
0000000.000000C3,
54.
0000000.000000C3,
63.
0000000.000000C3,7C3,
83.
0000000.000000C4,
15.
0000000.000000C4,
22.
0000000.000000C4,
37.
0000000.000000C4,
43.
0000000.000000C4,
59.
0000000.000000C4,
62.
0000000.000000C4,
77.
0000000.000000C4,
81.
0000000.000000C5,
12.
0000000.000000C5,
23.
0000000.000000C5,
39.
0000000.000000C5,
45.
0000000.000000C5,
55.
0000000.000000C5,
62.
0000000.000000C5,
76.
0000000.000000C5,
85.
0000000.000000C6,
15.
0000000.000000C6,
27.
0000000.000000C6,
32.
0000000.000000C6,
42.
0000000.000000C6,
53.
0000000.000000C6,
61.
0000000.000000C6,
74.
0000000.000000C6,
83.
0000000.000000X1,
10.
0000004.000000X1,
231.
000000.000000X1,
30.
0000003.000000X1,
40.
0000005.000000X1,
529.
000000.000000X1,
60.
0000000.000000X1,
70.
0000000.000000X1,
80.
0000008.000000X2,
10.
0000000.000000X2,
20.
0000003.000000X2,
30.
0000001.000000X2,
432.
000000.000000X2,
50.
0000003.000000X2,
60.
0000006.000000X2,
70.
0000002.000000X2,
81.
0000000.000000X3,
10.
0000007.000000X3,
20.
0000006.000000X3,
38.
0000000.000000X3,
40.
0000005.000000x3,
50.
0000005.000000X3,
60.
0000004.000000X3,
743.
000000.000000X3,
80.
0000004.000000X4,
10.
0000003.000000X4,
26.
0000000.000000X4,
30.
0000004.000000X4,
40.
0000001.000000X4,
50.
0000005.000000X4,
60.
0000000.000000X4,
70.
0000002.000000X4,
837.
000000.000000X5,
135.
000000.000000X5,
20.
0000001.000000X5,
30.
0000006.000000X5,
40.
0000003.000000X5,
50.
0000001.000000X5,
66.
0000000.000000X5,
70.
0000001.000000X5,
80.
0000004.000000X6,
10.
0000004.000000X6,
20.
0000006.000000X6,
314.
000000.000000X6,
40.
0000001.000000X6,
512.
000000.000000X6,
626.
000000.000000X6,
70.
0000000.000000X6,
80.
0000003.000000Dual PriceRowSlackorSurplus-
1.000000OBJ
634.
00001.000000SUP
10.
0000000.000000SUP
222.
000003.000000SUP
30.
0000001.000000SUP
40.
0000001.000000SUP
50.
0000002.000000SUP
60.000000-
3.000000DEM
10.000000-
3.000000DEM
20.000000-
4.000000DEM
30.000000-
3.000000DEM
40.000000-
5.000000DEM
50.000000-
3.000000DEM
60.000000-
6.000000DEM
70.000000-
2.000000DEM
80.000000实验一般整数规划问题3新天地购物广场某一层各时段(每为一时段)需要的服务员人数见下表按规2h定,服务员连续工作(即四个时段)为一班现要求安排服务员的工作时间,使服8h务部门服务员总数最少时段12345678服务员最少数目201618222616106
(1)给出原始代码;sets:time/
1..8/:required,start;endsetsdata:required=201618222616106;enddatamin=@sumtime:start;@fortimeJ:@sumtimeI11#le#4:start@wrapJ+I+2,8=requiredJ;end2计算结果决策变量求解结果粘贴Global optimalsolution found.Objective value:
46.00000Infeasibilities:
0.000000Total solveriterations:3Variable ValueReduced CostREQUIRED
120.
000000.000000REQUIRED
216.
000000.000000REQUIRED
318.
000000.000000REQUIRED
422.
000000.000000REQUIRED
526.
000000.000000REQUIRED
616.
000000.000000REQUIRED
710.
000000.000000REQUIRED
86.
0000000.000000START
126.
000000.000000。