LINDO程序 max0.5x1+0.4x2+0.6X3+0.5X4+0.9X5+x6 5x1+2x2+6x3+4x4+6x5+8x6<22 end int 6 结果报告 LP OPTIMUM FOUNDAT STEP OBJECTIVE VALUE= 3.00000000 NEW INTEGER SOLUTION OF 2.90000010 AT BRANCH O PIVOT RE-INSTALLING BEST SOLUTION OBJECTIVE FUNCTION VALUE 2.900000 VARIABLE VALUE REDUCED COST XI 0.000000 -0.500000 1.000000 -0.400000
LINDO 程序 max 0.5x1+0.4x2+0.6x3+0.5x4+0.9x5+x6 st 5x1+2x2+6x3+4x4+6x5+8x6<22 end int 6 结果报告 LP OPTIMUM FOUND AT STEP 5 OBJECTIVE VALUE = 3.00000000 NEW INTEGER SOLUTION OF 2.90000010 AT BRANCH 0 PIVOT 5 RE-INSTALLING BEST SOLUTION... OBJECTIVE FUNCTION VALUE 1) 2.900000 VARIABLE VALUE REDUCED COST X1 0.000000 -0.500000 X2 1.000000 -0.400000
1.000000 -0.600000 X4 0.000000 -0.500000 X5 1.000000 -0.900000 X6 1.000000 -1.000000 ROW SLACK OR SURPLUS DUAL PRICES 0.000000 0.000000 NO. ITERATIONS BRANCHES- O DETERM. 1.000E 0
X3 1.000000 -0.600000 X4 0.000000 -0.500000 X5 1.000000 -0.900000 X6 1.000000 -1.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 0.000000 NO. ITERATIONS= 5 BRANCHES= 0 DETERM.= 1.000E 0
