Question: Given the following linear programming model, answer the questions that follow. You are given the result of a computer program. The results are Maximize 9
- Given the following linear programming model, answer the questions that follow. You are given the result of a computer program. The results are
Maximize 9 X1 + 12 X2 + 10 X3
Subject to:
Machine Constraint: 3 X1 + 4 X2 + 3 X3 < 160
Labor Constraint: 6 X1 + 10 X2 + 4 X3 < 288
Materials Constraint: 2 X1 + 2 X2 + 7 X3 < 200
Product 2 Constraint: X1 < 16
OPTIMAL SOLUTION
Objective Function Value = 483.097
Variable Value Reduced Costs
-------------- --------------- ------------------
X1 16.000 0.000
X2 10.839 0.000
X3 20.903 0.000
Constraint Slack/Surplus Dual Prices
-------------- --------------- ------------------
1 5.935 0.000
2 0.000 1.032
3 0.000 0.839
4 0.000 1.129
OBJECTIVE COEFFICIENT RANGES
Variable Lower Limit Current Value Upper Limit
------------ --------------- --------------- ---------------
X1 7.871 9.000 No Upper Limit
X2 2.857 12.000 14.059
X3 4.800 10.000 18.750
RIGHT HAND SIDE RANGES
Constraint Lower Limit Current Value Upper Limit
------------ --------------- --------------- ---------------
1 154.065 160.000 No Upper Limit
2 192.000 288.000 304.727
3 70.400 200.000 226.286
4 0.000 16.000 30.154
a. If the number of minutes of Machine time was decreased to 155 minutes and the amount of materials were decreased to 170 pounds, would this change the solution? Provide proof.
b.The Dual Price for Constraint 1 (Machine time) is 4.2. In terms of this problem what does that mean?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help