Essay
The binding constraints for this problem are the first and second.
Min
x1 + 2x2
s.t.
x1 + x2 ≥ 300
2x1 + x2 ≥ 400
2x1 + 5x2 ≤ 750
x1 , x2 ≥ 0
a.Keeping c2 fixed at 2, over what range can c1 vary before there is a change in the optimal solution point?
b.Keeping c1 fixed at 1, over what range can c2 vary before there is a change in the optimal solution point?
c.If the objective function becomes Min 1.5x1 + 2x2, what will be the optimal values of x1, x2, and the objective function?
d.If the objective function becomes Min 7x1 + 6x2, what constraints will be binding?
e.Find the dual price for each constraint in the original problem.
Correct Answer:

Verified
a..8 ≤ c1 ≤ 2
B.1 ≤ c2 ≤ 2.5
C.x...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
B.1 ≤ c2 ≤ 2.5
C.x...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q3: The amount of a sunk cost will
Q4: The amount the objective function coefficient of
Q14: If the range of feasibility indicates that
Q16: A negative dual price for a constraint
Q17: To solve a linear programming problem with
Q28: The 100% Rule does not imply that
Q29: LINDO output is given for the following
Q31: Describe each of the sections of output
Q37: Use the following Management Scientist output to
Q38: Any change to the objective function coefficient