LINDO软件解题结果1

LINDO软件解题结果1 Lindo软件解题结果 homework1 LP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE 1) 31.00000 VARIABLE VALUE REDUCED COST X 13.000000 0.000000 Y 5.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 5.000000 0.000000 3) 9.000000 0.000000 4) 0.000000 0.500000 5) 0.000000 0.500000 6) 13.000000 0.000000 7) 5.000000 0.000000 NO. ITERATIONS= 2 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X 2.000000 1.000000 1.000000 Y 1.000000 1.000000 0.333333 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 2 10.000000 INFINITY 5.000000 3 60.000000 INFINITY 9.000000 4 18.000000 1.384615 3.333333 5 44.000000 10.000000 6.000000 6 0.000000 13.000000 INFINITY 7 0.000000 5.000000 INFINITY homework2 max 420x1L+420x2L+420x3L+360x1M+360x2M+360x3M+300x1S+300x2S+300x3S ST 900x1L+900x1M+900x1S-750x2L-750x2M-750x2S=0 450x1L+450x1M+450x1S-750x3L-750x3M-750x3S=0 20x1L+15x1M+12x1S<=13000 20x2L+15x2M+12x2S<=12000 20x3L+15x3M+12x3S<=5000 x1L+x1M+x1S<=750 x2L+x2M+x2S<=900 x3L+x3M+x3S<=450 End UNBOUNDED VARIABLES ARE: SLK 5 SLK 2 X1A X3B OBJECTIVE FUNCTION VALUE 1) -0.9999990E+08 VARIABLE VALUE REDUCED COST X1A 474316.812500 0.000000 X1B 0.000000 -233079.546875 X1C 0.000000 -233079.515625 X1D 0.000000 -233079.515625 X3A 0.000000 -0.932318 X3B 241545.906250 0.000000 X4A 0.000000 -0.983575 X4C 0.000000 0.000000 X5A 1.018000 0.000000 X5B 0.000000 0.000000 END 0.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 241545.906250 -0.966184 3) 0.000000 -0.932318 4) 0.000000 0.000000 5) 0.000000 -0.966184 6) 0.000000 0.000000 NO. ITERATIONS= 2 LP OPTIMUM FOUND AT STEP 6 OBJECTIVE FUNCTION VALUE 1) 696000.0 VARIABLE VALUE REDUCED COST X1L 516.666687 0.000000 X2L 0.000000 40.000000 X3L 0.000000 360.000000 X1M 177.777771 0.000000 X2M 666.666687 0.000000 X3M 0.000000 120.000000 X1S 0.000000 24.000000 X2S 166.666672 0.000000 X3S 416.666656 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 -0.080000 3) 0.000000 0.560000 4) 0.000000 12.000000 5) 0.000000 20.000000 6) 0.000000 60.000000 7) 55.555557 0.000000 8) 66.666664 0.000000 9) 33.333332 0.000000 NO. ITERATIONS= 6 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X1L 420.000000 40.000000 60.000000 X2L 420.000000 40.000000 INFINITY X3L 420.000000 360.000000 INFINITY X1M 360.000000 60.000000 15.000001 X2M 360.000000 59.999985 14.999998 X3M 360.000000 120.000000 INFINITY X1S 300.000000 24.000002 INFINITY X2S 300.000000 23.999998 48.000008 X3S 300.000000 INFINITY 96.000000 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 2 0.000000 25000.000000 50000.000000 3 0.000000 25000.000000 12500.000000 4 13000.000000 888.888855 2583.333496 5 12000.000000 500.000000 2000.000000 6 5000.000000 399.999969 200.000015 7 750.000000 INFINITY 55.555557 8 900.000000 INFINITY 66.666664 9 450.000000 INFINITY 33.333332 LP OPTIMUM FOUND AT STEP 6 OBJECTIVE FUNCTION VALUE 1) 696000.0 VARIABLE VALUE REDUCED COST X1L 516.666687 0.000000 X2L 0.000000 40.000000 X3L 0.000000 360.000000 X1M 177.777771 0.000000 X2M 666.666687 0.000000 X3M 0.000000 120.000000 X1S 0.000000 24.000000 X2S 166.666672 0.000000 X3S 416.666656 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 -0.080000 3) 0.000000 0.560000 4) 0.000000 12.000000 5) 0.000000 20.000000 6) 0.000000 60.000000 7) 55.555557 0.000000 8) 66.666664 0.000000 9) 33.333332 0.000000 NO. ITERATIONS= 6 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X1L 420.000000 40.000000 60.000000 X2L 420.000000 40.000000 INFINITY X3L 420.000000 360.000000 INFINITY X1M 360.000000 60.000000 15.000001 X2M 360.000000 59.999985 14.999998 X3M 360.000000 120.000000 INFINITY X1S 300.000000 24.000002 INFINITY X2S 300.000000 23.999998 48.000008 X3S 300.000000 INFINITY 96.000000 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 2 0.000000 25000.000000 50000.000000 3 0.000000 25000.000000 12500.000000 4 13000.000000 888.888855 2583.333496 5 12000.000000 500.000000 2000.000000 6 5000.000000 399.999969 200.000015 7 750.000000 INFINITY 55.555557 8 900.000000 INFINITY 66.666664 9 450.000000 INFINITY 33.333332 homework3-2 LP OPTIMUM FOUND AT STEP 6 OBJECTIVE FUNCTION VALUE 1) 22103.33 VARIABLE VALUE REDUCED COST X1 9.333333 0.000000 X2 5.000000 0.000000 X7 4.000000 0.000000 X3 0.333333 0.000000 X4 6.333333 0.000000 X5 0.000000 218.333328 X6 7.333333 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 -218.333328 3) 3.666667 0.000000 4) 0.000000 -218.333328 5) 0.000000 -218.333328 6) 0.000000 0.000000 7) 0.000000 -243.333328 8) 0.000000 -25.000000 9) 9.333333 0.000000 10) 5.000000 0.000000 11) 0.333333 0.000000 12) 6.333333 0.000000 13) 0.000000 0.000000 14) 7.333333 0.000000 15) 4.000000 0.000000 NO. ITERATIONS= 6 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X1 655.000000 327.499969 0.000000 X2 680.000000 0.000000 218.333328 X7 680.000000 0.000000 218.333328 X3 705.000000 327.499969 0.000000 X4 705.000000 327.499969 654.999939 X5 705.000000 INFINITY 218.333344 X6 705.000000 327.499969 654.999939 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 2 27.000000 0.500000 5.500000 3 22.000000 3.666667 INFINITY 4 26.000000 9.500000 1.000000 5 25.000000 0.500000 4.000000 6 21.000000 3.666667 0.333333 7 19.000000 0.500000 5.000000 8 18.000000 3.666667 0.333333 9 0.000000 9.333333 INFINITY 10 0.000000 5.000000 INFINITY 11 0.000000 0.333333 INFINITY 12 0.000000 6.333333 INFINITY 13 0.000000 0.000000 INFINITY 14 0.000000 7.333333 INFINITY 15 0.000000 4.000000 INFINITY homework3-3 min x1A+x1B+x1C+x1D ST 1.036324x1A+1.035x1B >=250000 x3A+x3B-1.036324x1A-1.035x1B=-250000 1.018x3A+1.058x1C-x4A-x4C=0 1.018x4A+1.035x3B>=250000 x5A+x5B=1.018x4A+1.035x3B-250000 1.118x1D+1.036324x5A+1.035x5B+1.058x4C>=300000 End