Question: The following linear programming problem has been solved by The Management Scientist. Use the output to answer th e questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3
The following linear programming problem has been solved by The Management Scientist. Use the
output to answer th
e questions.
LINEAR PROGRAMMING PROBLEM
MAX 25X1+30X2+15X3
S.T.
1) 4X1+5X2+8X31500
2) 9X1+15X2+3X31800
OPTIMAL SOLUTION
Objective Function Value =5600.000
| Variable | Value | Reduced Cost |
| x1 | 150.000 | 0.000 |
| x2 | 0.000 | 10.000 |
| x3 | 80.000 | 0.000 |
| Constraint | Slack/Surplus | Dual Price |
| 1 | 0.00 | 1.000 |
| 2 | 0.00 | 2.333 |
OBJECTIVE COEFFICIENT RANGE
| Variable | Lower Limit | Current Value | Upper Limit |
| x1 | 20.000 | 25.000 | 50.000 |
| x2 | no Lower Limit | 30.000 | 40.000 |
| x3 | 8.000 | 15.000 | 50.000 |
RIGHT HAND SIDE RANGE
| Constraint | Lower Limit | Current Value | Upper Limit |
| 1 | 600.000 | 1200.000 | 4000.000 |
| 2 | 450.000 | 1500.000 | 2700.000 |
A. Give the complete optimal solution.
b. Which constraints are binding?
c. What is the dual price for the second constraint? What interpretation does this have?
d. Over what range can the objective function coefficient of x2 vary before a new solution point becomes optimal?
e. By how much can the amount of resource 2 decrease before the dual price will change?
f. What would happen if the first constraint's right - hand side increased by 700 and the second's decreased by 350?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help