- The output for the below linear programming problem follows below:
Max: 25X1+30X2+15×3
S.T
- 4X1+5X2+5X3<1200
- 9X1+15X2+3×3<1500
Optimum Solution Output
Objective Function Value = 4,700.00
Variable Value Reduced Cost
X1 140.000 0.000
X2 0.000 10.000
X3 80.000 0.000
Constraints Slack/Surplus Dual Price
1 0.000 1.000
2 0.000 2.333
Objective Coefficient Ranges:
Variable Lower Limit Current Value Upper Limit
X1 19.286 25.000 45.000
X2 none 30.000 40.000
X3 8.333 15.000 50.000
RHS Ranges:
Constraints Lower Limit Current Value Upper Limit
1 666.667 1200.000 4000.000
2 450.000 1500.000 2700.000
- Give the complete optimal solution
- Which constraints are binding
Categories: