1-1 线性规划问题的数学模型
1-2 单纯形方法
1-3 对偶线性规划问题
1-4 运输问题
1-5 整数规划 习题解答
Linear programming
model and application
4/25/2024
4/59
数学建模方法
max=3.6*x11+5.6*x21+7.6*x31+1.8*x12+3.8*
x22+5.8*x32-0.2*x13+1.8*x23+3.8*x33;
-0.4*x11+0.6*x21+0.6*x31<0;
0.2*x11+0.2*x21-0.8*x31>0;
-0.85*x12+0.15*x22+0.15*x32<0;
0.6*x12+0.6*x22-0.4*x32>0;
0.5*x13+0.5*x23-0.5*x33>0;
x11+x12+x13<=2000;
x21+x22+x23<=2500;
x31+x32+x33<=1200;
LINGO求解程序见程序
求解结果:
Global optimal solution found.
Objective value: 24640.00
Total solver iterations: 5
Variable Value Reduced Cost
X11 1526.667 0.000000
X21 1017.778 0.000000
X31 0.000000 0.000000
X12 473.3333 0.000000
X22 1482.222 0.000000
X32 1200.000 0.000000
X13 0.000000 4.000000
X23 0.000000 0.000000
X33 0.000000 2.800000
Row Slack or Surplus Dual Price
1 24640.00 1.000000
2 0.000000 4.000000
3 508.8889 0.000000
4 0.000000 4.000000
5 693.3333 0.000000
6 0.000000 -2.800000
7 0.000000 5.200000
8 0.000000 3.200000
9 0.000000 5.200000
4/25/2024