运筹学计算机求解运输,运筹学上机报告运输问题的计算机求解.doc

运筹学上机报告运输问题的计算机求解.doc

运筹学上机实验报告单20142015学年第2学期实验名称运输问题的计算机求解日期2015年5月19日班级姓名学号实验目的掌握运输问题的LINGO软件求解方法。实验内容(1)运输问题LINGO编程与求解。(2)运输问题LINGO求解输出结果分析。操作步骤(1)进入LINGO软件。(2)利用相应例题(P77例33)熟悉运输问题的计算机求解步骤。(3)对求解中出现问题所进行内容在同学间相互交流，并进行总结。(4)完成上机作业(P85习题2、P87习题8)，并记录步骤与结果。结果显示与分析例题33由下图结果可知最优调运方案为X1150，X12150，X2150，X23200。最小总运输量90507015080507520034000(吨公里)。求解过程中迭代次数一次。习题2GLOBALOPTIMALSOLUTIONFOUNDOBJECTIVUE3300000INFEASIBILITIES0000000TOTALSOLVERITERATIONS10VARIABLUEREDUCEDCOSTA150000000000000A240000000000000A360000000000000A431000000000000B130000000000000B250000000000000B320000000000000B440000000000000B530000000000000B611000000000000X1,100000000000000X1,230000000000000X1,300000002000000X1,400000002000000X1,520000000000000X1,600000005000X2,100000000000000X2,220000000000000X2,320000000000000X2,400000002000000X2,500000000000000X2,600000003000000X3,130000000000000X3,200000003000000X3,300000002000000X3,419000000000000X3,500000001000000X3,611000000000000X4,100000002000000X4,200000001000000X4,300000001000000X4,421000000000000X4,510000000000000X4,600000002000000C1,120000000000000C1,210000000000000C1,330000000000000C1,430000000000000C1,520000000000000C1,650000000000000C2,130000000000000C2,220000000000000C2,320000000000000C2,440000000000000C2,530000000000000C2,640000000000000C3,130000000000000C3,250000000000000C3,340000000000000C3,420000000000000C3,540000000000000C3,610000000000000C4,140000000000000C4,220000000000000C4,320000000000000C4,410000000000000C4,520000000000000C4,620000000000000ROWSLACKORSURPLUSDUALPRICE13300000100000020000000100000030000000200000040000000200000050000000100000060000000100000070000000000000080000000000000090000000000000010000000010000001100000001000000可知最优调运方案为X1230，X1520，X2220，X2320，X3130，X3419，X3611，X4421，X4510。最优调用方案为330。求解过程中迭代次数10次。第八题GLOBALOPTIMALSOLUTIONFOUNDOBJECTIVUE7275000INFEASIBILITIES0000000TOTALSOLVERITERATIONS7VARIABLUEREDUCEDCOSTA150000000000000A210000000000000A315000000000000B125000000000000B260000000000000B330000000000000B470000000000000B511500000000000X1,100000000000000X1,225000000000000X1,300000001500000X1,425000000000000X1,500000003500000X2,125000000000000X2,200000001500000X2,330000000000000X2,445000000000000X2,500000001500000X3,100000000000000X3,235000000000000X3,300000001500000X3,400000001500000X3,511500000000000C1,110000000000000C1,215000000000000C1,320000000000000C1,420000000000000C1,540000000000000C2,120000000000000C2,240000000000000C2,315000000000000C2,430000000000000C2,530000000000000C3,130000000000000C3,235000000000000C3,340000000000000C3,455000000000000C3,525000000000000ROWSLACKORSURPLUSDUALPRICE172750001000000200000005000000300000001500000400000002500000500000005000000600000001000000700000000000000800000001500000900000000000000GLOBALOPTIMALSOLUTIONFOUNDOBJECTIVUE7325000INFEASIBILITIES0000000TOTALSOLVERITERATIONS7VARIABLUEREDUCEDCOSTA150000000000000A210000000000000A313000000000000B125000000000000B211500000000000B330000000000000B470000000000000B540000000000000X1,100000000000000X1,225000000000000X1,300000001500000X1