Solved

The Binding Constraints for This Problem Are the First and Second

Question 57

Essay

The binding constraints for this problem are the first and second.
Minx1+2x2 s.t. x1+x23002x1+x24002x1+5x2750x1,x20\begin{array} { l r } \operatorname { Min } & x _ { 1 } + 2 x _ { 2 } \\\text { s.t. } & x _ { 1 } + x _ { 2 } \geq 300 \\&2 x _ { 1 } + x _ { 2 } \geq 400 \\&2 x _ { 1 } + 5 x _ { 2 } \leq 750 \\&x _ { 1 } , x _ { 2 } \geq 0\end{array}
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:

verifed

Verified

a..8 c1 ...

View Answer

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Unlock this Answer For Free Now!

View this answer and more for free by performing one of the following actions

qr-code

Scan the QR code to install the App and get 2 free unlocks

upload documents

Unlock quizzes for free by uploading documents