第三章 线规划的典型应用.pptVIP

min = 0*x1+0.1*x2+0.2*x3+0.3*x4+0.8*x5; x1+2*x2+x4=100; 2*x3+2*x4+x5=100; 3*x1+x2+2*x3+3*x5=100; Global optimal solution found. Objective value: 10.00000 Total solver iterations: 0 Variable Value Reduced Cost X1 100.0000 0.000000 X2 0.000000 0.1000000 X3 50.00000 0.000000 X4 0.000000 0.1000000