Question

用LINGO模型求解，有详细过程，比较急，谢谢

Answer 1

min = 5*x1+5.1*x2+5.4*x3+5.5*x4+5.2*x5+5.3*x6+5.0*x7+0.2*(y1+y2+y3+y4+y5+y6);
x1-y1 >= 15;
x2 + y1 - y2 >= 25;
x3 + y2 - y3 >=35;
x4 + y3 >= 25;
x5 - y5 >= 30;
x6 + y5 - y6 >= 35;
x7 + y6 >= 15;
x1 <= 30;
x2 <= 40;
x3 <= 45;
x4 <= 20;
x5 <= 40;
x6 <= 45;
x7 <= 30;

求解结果：
Global optimal solution found.
Objective value: 944.5000
Infeasibilities: 0.000000
Total solver iterations: 8

Variable Value Reduced Cost
X1 15.00000 0.000000
X2 40.00000 0.000000
X3 25.00000 0.000000
X4 20.00000 0.000000
X5 30.00000 0.000000
X6 35.00000 0.000000
X7 15.00000 0.000000
Y1 0.000000 0.000000
Y2 15.00000 0.000000
Y3 5.000000 0.000000
Y4 0.000000 0.2000000
Y5 0.000000 0.1000000
Y6 0.000000 0.5000000
Row Slack or Surplus Dual Price
1 944.5000 -1.000000
2 0.000000 -5.000000
3 0.000000 -5.200000
4 0.000000 -5.400000
5 0.000000 -5.600000
6 0.000000 -5.200000
7 0.000000 -5.300000
8 0.000000 -5.000000
9 15.00000 0.000000
10 0.000000 0.1000000
11 20.00000 0.000000
12 0.000000 0.1000000
13 10.00000 0.000000
14 10.00000 0.000000
15 15.00000 0.000000

追问

能不能解释一下，谢谢了

您好 能不能在发一下截图 谢谢了

还有灵敏度 真的真的比较急呀