LP OPTIMUM FOUND AT STEP 0 OBJECTIVE FUNCTION VALUE 8000.000 VARIABLE VALUE REDUCED COST 0.000000 0.000000 X21 1.400000 0.000000 1000.000000 0.000000 1000.000000 0.000000 5000.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 0.00 6.000000 0.000000 -2.400000 0.000000 -1.000000 0.000000 0.000000 NO. ITERATIONS= 方法二 model max=4.8*x11+4.8*x21+5.6*12+5.6*x22-10*x1-8*x2-6*x3; x1<500 x2<500 x3<500; +500; 0.5★x11-0.5*x21>0 0.4★x12-0.6*x22>0 x1+X2+x3-X=0 x1-500)★x2=0; x2-500)*x3=0;LP OPTIMUM FOUND AT STEP 0 OBJECTIVE FUNCTION VALUE 1) 8000.000 VARIABLE VALUE REDUCED COST X11 0.000000 0.000000 X21 0.000000 1.400000 X12 1500.000000 0.000000 X22 1000.000000 0.000000 X 1000.000000 0.000000 R3 5000.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 6.000000 3) 0.000000 5.000000 4) 0.000000 -2.400000 5) 0.000000 -1.000000 6) 0.000000 0.000000 7) 500.000000 0.000000 8) 0.000000 0.000000 NO. ITERATIONS= 0 方法二 model: max=4.8*x11+4.8*x21+5.6*x12+5.6*x22-10*x1-8*x2-6*x3; x1<500; x2<500; x3<500; x11+x12<x+500; x21+x22<1000; 0.5*x11-0.5*x21>0; 0.4*x12-0.6*x22>0; x1+x2+x3-x=0; (x1-500)*x2=0; (x2-500)*x3=0;