运筹学实验报告
学 院：
学 号：
姓 名：
联系方式：
《 》实验报告
实验名称： 成绩：
LP OPTIMUM FOUND AT STEP 3
OBJECTIVE FUNCTION VALUE
1) 12737.06
VARIABLE VALUE REDUCED COST
X1 294.117645 0.000000
X2 1500.000000 0.000000
X3 0.000000 1.414647
X4 58.823528 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 1.953529
3) 0.000000 0.242353
4) 0.000000 1.378235
NO. ITERATIONS= 3
LP OPTIMUM FOUND AT STEP 1
OBJECTIVE FUNCTION VALUE
1) 35.00000
VARIABLE VALUE REDUCED COST
X1 5.000000 0.000000
X2 0.000000 2.666667
X3 3.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 0.333333
3) 0.000000 0.666667
NO. ITERATIONS= 1
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X1 4.000000 2.000000 1.000000
X2 1.000000 2.666667 INFINITY
X3 5.000000 1.666667 1.666667
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 45.000000 15.000000 15.000000
3 30.000000 15.000000 7.500000
LP OPTIMUM FOUND AT STEP 1
OBJECTIVE VALUE = 17.3684216
SET X3 TO >= 3 AT 1, BND= 17.00 TWIN= 17.29 16
NEW INTEGER SOLUTION OF 17.0000000 AT BRANCH 1 PIVOT 16
BOUND ON OPTIMUM: 17.29412
DELETE X3 AT LEVEL 1
ENUMERATION COMPLETE. BRANCHES= 1 PIVOTS= 16
LAST INTEGER SOLUTION IS THE BEST FOUND
RE-INSTALLING BEST SOLUTION...
OBJECTIVE FUNCTION VALUE
1) 17.00000
VARIABLE VALUE REDUCED COST
X1 0.000000 -4.000000
X2 2.000000 -1.000000
X3 3.000000 -5.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 24.000000 0.000000
3) 7.000000 0.000000
4) 0.000000 0.000000
NO. ITERATIONS= 16
BRANCHES= 1 DETERM.= 1.000E 0
第二篇：运筹学第一次实验报告
《运筹学》实验报告
