线性规划有关的方程组,求MAX.

来源：百度知道 编辑：UC知道 时间：2024/07/03 03:49:27
X1 + X2 + X3 + 1.5X4 <= 100;

400X4 + 3X5 <= 25000;

20X1 + 35X2 + 10X3 + 100X4 + 0.6X5 >= 3500;

30X1 + 75X2 + 40X3 + 50X4 + 0.3X5 >= 4000;

X4 <= 32;

X5 <= 3000;

MAX=175X1 + 300X2 + 120X3 + 450X4 + 3.5X5

用lingo求得
MAX=175*X1 + 300*X2 + 120*X3 + 450*X4 + 3.5*X5;

X1 + X2 + X3 + 1.5*X4 <= 100;
400*X4 + 3*X5 <= 25000;
20*X1 + 35*X2 + 10*X3 + 100*X4 + 0.6*X5 >= 3500;
30*X1 + 75*X2 + 40*X3 + 50*X4 + 0.3*X5 >= 4000;
X4 <= 32;
X5 <= 3000;
报告中的结果为40500
Global optimal solution found.
Objective value: 40500.00
Total solver iterations: 1

Variable Value Reduced Cost
X1 0.000000 125.0000
X2 52.00000 0.000000
X3 0.000000 180.0000
X4 32.00000 0.000000
X5 3000.000 0.000000

Row Slack or Surplus Dual Price