线性重点规划的灵敏度分析实验报告

1、运筹学/线性规划实验报告实验室：实验日期:实验项目线性规划的敏捷度分析系别数学系姓名学 号班级指引教师成绩一实验目的初步掌握用Lingo/Lindo对线性规划问题进行敏捷度分析日勺措施，理解解报告日勺内容。初步掌握对实际日勺线性规划问题建立数学模型，并运用计算机求解分析日勺一般措施。二实验环境Lingo软件三实验内容（波及数学模型、上机程序、实验成果、成果分析与问题解答等）例题2-10MODEL:_1 MAX= 2 火 X_1 +3 * X_2 ;_2 X_1 + 2 火 X_2+ X_3 = 8 ;_3 4 火 X_1 + X_4=16 ;_4 4 火 X_2 + X_5END编程sets

2、:is/1.3/:b;js/1.5/:c,x;links(is,js):a;=12 ;endsetsmax=sum (js(J):c(J)*x(J);for (is(I): sum (js(J):a(I,J)*x(J)=b(I);data :c=23000;b=81612;a=121004001004001;enddataend敏捷度分析Ranges in which the basis is unchanged:Objective Coefficient RangesCurrentAllowableAllowableVariableCoefficientIncreaseDecreaseX(

3、1)2.000000INFINITY0.5000000X( 2)3.0000001.0000003.000000X( 3)0.01.500000INFINITYX( 4)0.00.1250000INFINITYX( 5)0.00.75000000.2500000Righthand Side RangesRowCurrentAllowableAllowableRHSIncreaseDecrease28.0000002.0000004.000000316.0000016.000008.000000412.00000INFINITY4.000000当b2在8,32 之间变化时最优基不变最优解Glob

4、al optimal solution foundat iteration:0Objective value:14.00000VariableValueReducedCostB( 1)8.0000000.000000B( 2)16.000000.000000B( 3)12.000000.000000C( 1)2.0000000.000000C( 2)3.0000000.000000C( 3)0.0000000.000000C( 4)0.0000000.000000C( 5)0.0000000.000000X( 1)4.0000000.000000X( 2)2.0000000.000000X(

5、3)0.0000001.500000X( 4)0.0000000.1250000X( 5)4.0000000.000000A( 1, 1)1.0000000.000000endsetsmax=sum (js(J):c(J)*x(J)；for (is(I): sum (js(J):a(I,J)*x(J)=b(I);data :c=2 3 0 0 0;b=12 16 12;a=1 2 1 0 04 0 0 1 00 4 0 0 1;end dataend最优解Global optimal solutionfound at iteration:2Objective value:17.00000Var

6、iableValueReduced CostB(1)12.000000.000000B(2)16.000000.000000B(3)12.000000.000000C(1)2.0000000.000000C(2)3.0000000.000000C(3)0.0000000.000000C(4)0.0000000.000000C(5)0.0000000.000000X(1)4.0000000.000000X(2)3.0000000.000000X(3)2.0000000.000000X(4)0.0000000.5000000X(5)0.0000000.7500000A(1,1)1.0000000.

7、000000A( 1,2)2.0000000.000000A(1,3)1.0000000.000000A(1,4)0.0000000.000000A(1,5)0.0000000.000000A(2,1)4.0000000.000000A( 2,2)0.0000000.000000A( 2, 3)0.0000000.000000A( 2,4)1.0000000.000000A( 2,5)0.0000000.000000A( 3,1)0.0000000.000000A( 3,2)4.0000000.000000A( 3,3)0.0000000.000000A( 3,4)0.0000000.0000

8、00A( 3,最优解(4,3,2,0,0)最优值z = 17 分析5)1.0000000.000000RowSlack or SurplusDual Price17.000001.0000000.0000000.0000000.0000000.50000000.0000000.7500000Ranges in which the basis is unchanged:Objective Coefficient RangesCurrentAllowableAllowableVariableX( 1)X( 2)X( 3)X( 4)X( 5)Row234CoefficientIncreaseDecrease2.000000INFINITY2.0000003.000000INFINITY3.0000000.01.500000INFINITY0.00.5000000INFINITY0.00.7500000INFINITYRight