运筹学实验一线性规划求解、运输问题、整数规划求解

1、西华大学上机实验报告课程名称：运筹学年级/专业：2009水利水电工程实验成绩：指导教师：施浩然姓名：丁冬冬实验日期：2011年11月实验名称：线性规划求解、运输问题、 整数规划求解学号:实验学时：3一、实验目的掌握线性规划求解的基本方法，熟悉灵敏度分析的步骤和内容；掌握运输问题的模型， 概念，求解方法；掌握整数规划的算法。在熟悉lingo软件基本功能基础上，能熟练操作,正确完成模型求解过程及分析过程。二、实验内容或设计思想1. lingo软件和运筹学实验软件的安装及菜单熟悉了解2. lingo软件和运筹学实验软件应用内容之：任选几种不同类型的LP输入计算程序，运行求解；完成产销平衡的运输问题求

2、解；求解任一整数规划。三、实验环境与工具计算机，lingo软件，运筹学软件 四、实验过程或实验数据1、用lingo求解线性规划某家具公司制造书桌、餐桌和椅子，所用的资源有三种：木料、木工和漆工。生产数据如下表所示:每个书桌每个餐桌每个椅子现有资源总数木料7单位6单位1单位46单位漆工4单位2单位1.5单位20单位木工2单位1.5单位0.5单位8单位成品单价50单位30单位20单位若要求桌子的生产量不超过5件，如何安排三种产品的生产可使利润最大？用DESKS TABLES和CHAIRS分别表示三种产品的生产量，建立LP模型。max=50*desks+30*tables+20*chairs;7*d

3、esks+6*tables+chairs<=46;4*desks+2*tables+1.5*chairs<=20;2*desks+1.5*tables+.5*chairs<=8;tables<=5;Global optimal soluti on found.Objective value:272.0000Total solver iterati ons:2Variable DESKS TABLESValue Reduced Cost0.0000006.0000001.6000000.000000RowSlack or SurplusDual Price1272.000

4、01.000000225.200000.00000030.00000012.0000040.0000004.00000053.4000000.00000011.200000.0000002、用LINGO软件计算运输问题6个发点8个收点的最小费用运输问题。产销单位运价如下表。位销地 运价产地BB2B3BB5BeBBe产量A弋8267425980A4953858255A5219743357A76731127143A2395726541A5522814352销量3537253241364338使用LINGO软件，编制程序如下:CHAIRSmodel :sets :warehouses/wh1.wh6

5、/: capacity;ven dors/v1.v8/: dema nd;lin ks(warehouses,ve ndors): cost, volume; en dsetsmin =sum(li nks: cost*volume);for (vendors(J):sum(warehouses(I): volume(I,J)=dema nd(J);for (warehouses(I):sum(ve ndors(J): volume(I,J)<=capacity(I);datacapacity=60 55 51 43 41 52; dema nd=35 37 22 32 41 32 43

6、 38; cost=6 2 6 7 4 2 9 54 9 5 3 8 5 8 25 2 1 9 7 4 3 37 6 7 3 9 2 7 12 3 9 5 7 2 6 55 5 2 2 8 1 4 3; en ddata endGlobal optimal soluti on founObjective value:638.000016Total solver iterati ons:VariableValueReduced CostCAPACITY( WH1)80.000000.000000CAPACITY( WH2)55.000000.000000CAPACITY( WH3)57.0000

7、00.000000CAPACITY( WH4)43.000000.000000CAPACITY( WH5)41.000000.000000CAPACITY( WH6)52.000000.000000DEMAND( V1)35.000000.000000DEMAND( V2)37.000000.000000DEMAND( V3)25.000000.000000DEMAND( V4)32.000000.000000DEMAND( V5)41.000000.000000DEMAND( V6)36.000000.000000DEMAND( V7)43.000000.000000DEMAND( V8)3

8、8.000000.000000COST( WH1, V1)8.0000000.000000COST( WH1, V2)2.0000000.000000COST( WH1, V3)6.0000000.000000COST( WH1, V4)7.0000000.000000COST( WH1, V5)4.0000000.000000COST( WH1, V6)2.0000000.000000COST( WH1, V7)9.0000000.000000COST( WH1, V8)5.0000000.000000COST( WH2, V1)4.0000000.000000COST( WH2, V2)9

9、.0000000.000000COST( WH2, V3)5.0000000.000000COST( WH2, V4)3.0000000.000000COST( WH2, V5)8.0000000.000000COST( WH2, V6)5.0000000.000000COST( WH2, V7)8.0000000.000000COST( WH2, V8)2.0000000.000000COST( WH3, V1)5.0000000.000000COST( WH3, V2)2.0000000.000000COST( WH3, V3)1.0000000.000000COST( WH3, V4)9

10、.0000000.000000COST( WH3, V5)7.0000000.000000COST( WH3, V6)4.0000000.000000COST( WH3, V7)3.0000000.000000COST( WH3, V8)3.0000000.000000COST( WH4, V1)7.0000000.000000COST( WH4, V2)6.0000000.000000COST( WH4, V3)7.0000000.000000COST( WH4, V4)3.0000000.000000COST( WH4, V5)11.000000.000000COST( WH4, V6)2

11、.0000000.000000COST( WH4, V7)7.0000000.000000COST( WH4, V8)1.0000000.000000COST( WH5, V1)2.0000000.000000COST( WH5, V2)3.0000000.000000COST( WH5, V3)9.0000000.000000COST( WH5, V4)5.0000000.000000COST( WH5, V5)7.0000000.000000COST( WH5, V6)2.0000000.000000COST( WH5, V7)6.0000000.000000COST( WH5, V8)5.0000000.000000COST( WH6, V1)5.0000000.000000COST