运筹学实验报告lingo软件的使用习题集代码_第1页
运筹学实验报告lingo软件的使用习题集代码_第2页
运筹学实验报告lingo软件的使用习题集代码_第3页
运筹学实验报告lingo软件的使用习题集代码_第4页
运筹学实验报告lingo软件的使用习题集代码_第5页
已阅读5页,还剩30页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1/17姓姓学班实验报告相关问题说明:本实验是运筹学课内安排的上机操作实验。目的在于了解、熟悉计算机Lingo软件在运筹学模型求解中的作用,激发学习兴趣,提高学习效果,增强自身的动手能力,提高实际应用能力。1.实验前认真做好理论准备,仔细阅读实验指导书;2.遵从教师指导,认真完成实验任务,按时按质提交实验报告。4.运筹学编写组主编,运筹学(修订版),清华大学,19905.蓝伯雄主编,管理数学(下)—运筹学,清华大学,19976.胡运权主编,运筹学习题集(修订版),清华大学,19957.胡运权主编,运筹学教程(第二版),清华大学,20032/17实验内容maxz=8x+6x12(9x+8x12|7x1+11241212对偶价格就是说对偶价格就是说约束方程右端变量增加1对目标函数值的影响(1)代码max=8*x1+6*x2;9*x1+8*x2<=12;7*x1+11*x2<=24;9*x1+11*x2<=13;x1>=0;x2>=0;(2)计算结果Globaloptimalsolutionfound.Objectivevalue:10.66667Totalsolveriterations:2VariableXXValue1.3333330.000000ReducedCost0.0000001.1111111RowSlackorSurplus10.666671.000000234234514.666671.0000001.333333DualPrice0.88888890.0000000.0000000.0000001/172/1760.0000000.000000Rangesinwhichthebasisisunchanged:ObjectiveCoefficientRangesX2VariableX16.000000CurrentCoefficient8.0000001.111111AllowableIncreaseINFINITYINFINITYAllowableDecrease1.250000RighthandSideRanges5RowCurrent212.00000324.00000413.000000.01.33333360.0AllowableIncrease1.000000INFINITYINFINITYINFINITY0.0AllowableDecrease12.0000014.666671.000000INFINITY销销地cij产地A1A2A3A4A5A6B4733952B7538764B5487978B645725B2252639B3951762B8923153B6254221MinZ=6CijXiji=1j=1Xij<=bj(j=1...8)销量约束8Xij=ai(i=1...6)产量约束j=1Xij≥0(i=1...6;j=1...8)!6发点8model:输问题;warehouses/wh1..wh6/:capacity;vendors/v1..v8/:demand;links(warehouses,vendors):cost,volume;endsetsfor(vendors(J):sum(warehouses(I):volume(I,J))<=demand(J));!需求约束;for(warehouses(I):sum(vendors(J):volume(I,J))=capacity(I));!产量约束;capacity=554742524132;demand=6055514341524338;cost=629742594553853252137483767992712365726559228143;enddataGlobaloptimalsolutionfound.Objectivevalue:Infeasibilities:Totalsolveriterations:ModelClass:Totalvariables:Nonlinearvariables:Integervariables:473.00000.0000009003/174/17Totalconstraints:15Nonlinearconstraints:0Totalnonzeros:144Nonlinearnonzeros:0VariableCAPACITY(WH1)CAPACITY(WH2)CAPACITY(WH3)CAPACITY(WH4)CAPACITY(WH5)CAPACITY(WH6)COST(WH1,V1)COST(WH1,V2)COST(WH1,V3)COST(WH1,V4)COST(WH1,V5)COST(WH1,V6)COST(WH1,V7)COST(WH1,V8)COST(WH2,V1)COST(WH2,V2)COST(WH2,V3)COST(WH2,V4)COST(WH2,V5)COST(WH2,V6)COST(WH2,V7)COST(WH2,V8)COST(WH3,V1)COST(WH3,V2)COST(WH3,V3)COST(WH3,V4)COST(WH3,V5)COST(WH3,V6)COST(WH3,V7)COST(WH3,V8)Value55.0000047.0000042.0000052.0000041.0000032.0000060.0000055.0000051.0000043.0000041.0000052.0000043.0000038.000006.0000002.0000009.0000007.0000004.0000002.0000005.0000009.0000004.0000005.0000005.0000003.0000008.0000005.0000003.0000002.0000005.0000002.0000001.0000003.0000007.0000004.0000008.0000003.000000ReducedCost0.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000005/17COST(WH6,V2)VOLUME(WH1,V7)VOLUME(WH3,V3)COST(WH4,V1)COST(WH4,V2)COST(WH4,V3)COST(WH4,V4)COST(WH4,V5)COST(WH4,V6)COST(WH4,V7)COST(WH4,V8)COST(WH5,V1)COST(WH5,V2)COST(WH5,V3)COST(WH5,V4)COST(WH5,V5)COST(WH5,V6)COST(WH5,V7)COST(WH5,V8)COST(WH6,V1)9.000000COST(WH6,V3)COST(WH6,V4)COST(WH6,V5)COST(WH6,V6)COST(WH6,V7)COST(WH6,V8)MEWHVMEWHVMEWHVMEWHVMEWHVMEWHV0.000000MEWHVMEWHVMEWHVMEWHVMEWHVMEWHVMEWHVMEWHVMEWHVMEWHVMEWHV42.00000MEWHVMEWHV7.0000006.0000007.0000009.0000009.0000002.0000007.0000001.0000002.0000003.0000006.0000005.0000007.0000002.0000006.0000005.0000005.0000000.0000002.0000002.0000008.0000001.0000004.0000003.0000000.00000055.000000.0000000.0000000.0000000.0000003.0000000.0000000.0000000.0000000.00000043.000000.0000000.0000004.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000004.0000000.0000007.0000005.0000002.0000000.0000008.0000001.0000002.0000002.0000000.0000005.0000002.0000000.0000000.0000004.0000001.0000002.0000006.0000006/17VOLUME(WH4,V4)VOLUME(WH5,V3)VOLUME(WH6,V2)1473.00001MEWHVMEWHVMEWHVMEWHVMEWHVMEWHV0.000000MEWHVMEWHVMEWHVMEWHVMEWHVMEWHV0.000000MEWHVMEWHVMEWHVMEWHVMEWHVMEWHV0.000000MEWHVMEWHVMEWHVMEWHVMEWHVMEWHV-1.000000234567890.0000000.0000000.0000000.0000000.0000000.0000000.0000007.0000000.00000014.000000.00000038.0000041.000000.0000004.0000000.0000000.0000000.0000000.0000000.0000000.0000008.0000000.0000000.0000000.00000032.000000.0000000.000000SlackorSurplus19.000000.0000009.0000000.00000041.000006.00000039.000000.0000000.0000000.0000000.0000000.0000000.000000-1.0000003.0000007.0000003.0000005.0000004.0000005.0000007.0000000.0000005.0000000.0000000.0000001.0000003.0000005.0000000.0000004.0000004.0000004.0000001.0000001.0000007.0000000.0000003.0000003.000000DualPrice0.0000000.0000000.0000000.0000000.0000000.0000000.0000001.000000-2.000000-3.000000-1.000000-2.000000-2.0000007/17某服务部门各时段(每2h为一时段)需要的服务员人数见下表。按规定,服务1234567服务员最少数目8985sets:time/x1..x8/:required,start;endsetsdata:!每天所需的最少职员数;required=10891113853;enddata!最小化每周所需职员数;min=sum(time:start);for(time(J):sum(time(I)|I#le#4:start(wrap(J+I+2,8)))>=required(J));dGlobaloptimalsolutionfound.Objectivevalue:23.00000Totalsolveriterations:3START(X5)VariableREQUIRED(X1)REQUIRED(X2)REQUIRED(X3)REQUIRED(X4)REQUIRED(X5)REQUIRED(X6)REQUIRED(X7)REQUIRED(X8)START(X1)START(X2)START(X3)START(X4)8.000000START(X6)START(X7)Value10.000008.0000009.00000011.0000013.000008.0000005.0000003.00000013.000000.0000000.0000002.0000000.0000000.0000000.000000ReducedCost0.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000008/17START(X8)0.0000000.000000123.00000RowSlackorSurplus-1.0000000.0000000.0000000.0000004.0000002.0000000.0000007.0000005.0000007.0000003456789DualPrice-1.0000000.0000000.0000000.000000-1.0000000.0000000.0000000.000000BB486B576B37B289979B47666AAA3AAsets:workers/w1..w5/;jobs/j1..j5/;links(workers,jobs):cost,volume;endsetsmin=sum(links:cost*volume);!每个工人只能有一份工作;for(workers(I):sum(jobs(J):volume(I,J))=1;!每份工作只能有一个工人;for(jobs(J):sum(workers(I):volume(I,J))=1;data:cost=48715127917141069128767146106912106;9/17enddatadGlobaloptimalsolutionfound.Objectivevalue:34.00000Totalsolveriterations:10VariableCOST(W1,J1)COST(W1,J2)COST(W1,J3)COST(W1,J4)COST(W1,J5)COST(W2,J1)COST(W2,J2)COST(W2,J3)COST(W2,J4)COST(W2,J5)COST(W3,J1)COST(W3,J2)COST(W3,J3)COST(W3,J4)COST(W3,J5)COST(W4,J1)COST(W4,J2)COST(W4,J3)COST(W4,J4)COST(W4,J5)COST(W5,J1)COST(W5,J2)COST(W5,J3)COST(W5,J4)COST(W5,J5)VOLUME(W1,J1)VOLUME(W1,J2)VOLUME(W1,J3)VOLUME(W1,J4)VOLUME(W1,J5)VOLUME(W2,J1)VOLUME(W2,J2)VOLUME(W2,J3)VOLUME(W2,J4)VOLUME(W2,J5)Value4.0000008.0000007.00000015.0000012.000007.0000009.00000017.0000014.0000010.000006.0000009.00000012.000008.0000007.0000006.0000007.00000014.000006.00000010.000006.0000009.00000012.0000010.000006.0000000.0000000.0000001.0000000.0000000.0000000.0000001.0000000.0000000.0000000.000000ReducedCost0.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000003.0000005.0000000.00000013.0000011.000000.0000000.0000004.0000006.0000003.000000/17VOLUME(W3,J1)VOLUME(W3,J2)VOLUME(W3,J3)VOLUME(W3,J4)VOLUME(W3,J5)VOLUME(W4,J1)VOLUME(W4,J2)VOLUME(W4,J3)VOLUME(W4,J4)VOLUME(W4,J5)VOLUME(W5,J1)VOLUME(W5,J2)VOLUME(W5,J3)0.000000VOLUME(W5,J4)VOLUME(W5,J5)1.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000001.0000000.0000000.0000000.0000000.0000000.0000001.0000000.0000001.0000000.0000001.0000001.0000001.0000000.0000003.0000000.0000005.0000000.0000001.0000003.0000000.000000134.00000RowSlackorSurplus-1.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000003456789DualPrice-1.000000-7.000000-6.000000-5.000000-6.0000000.000000-2.000000-6.000000-1.0000000.000000012345040505sets:R/1..6/:z;L/1..3/;c(R,L):x,y;endsetsdata:X=000151526404040806045907050;z=012345;enddatamax=sum(c(i,j):X(i,j)*y(i,j));for(l(i):sum(c(j,k)|k#eq#1:y(j,k))=1);sum(c(i,j):y(i,j)*z(i))=5;for(c(i,j):Bin(y(i,j)));endGlobaloptimalsolutionfound.Objectivevalue:Extendedsolversteps:Totalsolveriterations:VariableZ(1)Z(2)Z(3)Z(4)Z(5)Z(6)X(1,1)X(1,2)X(1,3)X(2,1)X(2,2)X(2,3)X(3,1)X(3,2)X(3,3)X(4,1)X(4,2)X(4,3)X(5,1)Value0.0000001.0000002.0000003.0000004.0000005.0000000.0000000.0000000.0000005.0000005.0000004.00000015.0000015.0000026.0000040.0000040.0000040.0000080.0000090.0000000ReducedCost0.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.0000000.000000/17X(5,2)60.00000X(5,3)45.000000.000000X(6,1)90.00000X(6,2)70.00000X(6,3)50.00000Y(1,1)0.000000Y(1,2)0.000000Y(1,3)0.000000Y(2,1)0.000000Y(2,2)0.000000Y(2,3)0.000000Y(3,1)0.000000Y(3,2)0.000000Y(3,3)0.000000Y(4,1)0.000000Y(4,2)0.000000Y(4,3)0.000000Y(5,1)0.000000Y(5,2)0.000000Y(5,3)0.000000Y(6,1)1.000000Y(6,2)0.000000Y(6,3)0.000000RowSlackorSurplus190.000001.0000002342340.0000000.00000050.00000050.0000000.0000000.0000000.0000000.0000000.0000000.000000-5.000000-5.000000-4.000000-15.00000-15.00000-26.00000-40.00000-40.00000-40.00000-80.00000-60.00000-45.00000-90.00000-70.00000-50.00000DualPrice0.0000000.0000000.0000000.000000VV7V5V10V9VVVVVV8/17l1,2=6,l1,3=5,l2,4=3,l2,5=6,l2,6=9,l3,4=7,l3,5=5,l3,6=11,l4,7=9,l4,8=1,l5,7=8,l5,8=7,l5,9=5,l6,8=4,l6,9=10,l7,10=5,l8,10=7,l9,10=9 (li,j表示Vi到Vj之间的权重)路问题;data:n=10;enddatasets:cities/1..n/:F;!10个城市;roads(cities,cities)/,44,76,87,108,109,10,54,86,9,6/:D,P;endsetsdata:D=653697511918754

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论