数学建模线性规划的求解.doc

The Standardization Office was revised on the afternoon of December 13, 2020
数学建模线性规划的求解
实验二 线性规划的求解
学号：1划
Variable Value Reduced Cost
X1
X2
X3
X4
X5
X6
Row Slack or Surplus Dual Price
1
2
3
4
5
6
灵敏度分析：
例5：
代码：
model:
title 储蓄所招聘计划;
min=100*x1+100*x2+40*y1+40*y2+40*y3+40*y4+40*y5;
x1+x2+y1>=4;
x1+x2+y1+y2>=3;
x1+x2+y1+y2+y3>=4;
x2+y1+y2+y3+y4>=6;
x1+y2+y3+y4+y5>=5;
x1+x2+y3+y4+y5>=6;
x1+x2+y4+y5>=8;
x1+x2+y5>=8;
y1+y2+y3+y4+y5<=3;
结果：
Global optimal solution found.
Objective value:
Infeasibilities:
Total solver iterations: 5
Model Title: 储蓄所招聘计划
Variable Value Reduced Cost
X1
X2
Y1
Y2
Y3
Y4
Y5
Row Slack or Surplus Dual Price
1
2