Question
Version:0.9 StartHTML:0000000105 EndHTML:0000006652 StartFragment:0000000141 EndFragment:0000006612 The binding constraints for this problem are the first and second. Min x1 + 2x2 s.t. x1 + x2 300
Version:0.9 StartHTML:0000000105 EndHTML:0000006652 StartFragment:0000000141 EndFragment:0000006612
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.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started