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
b.1
c.x1 = 25...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q8: Decreasing the objective function coefficient of a
Q10: For a minimization problem,a positive dual price
Q18: Which of the following is not a
Q19: A section of output from The
Q22: The dual price associated with a constraint
Q23: A negative dual price for a constraint
Q25: In a linear programming problem, the
Q26: Decision variables must be clearly defined before
Q46: Describe each of the sections of output
Q51: Explain the two interpretations of dual prices
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents