Question: Only #3 please!! 2. (25 points) Draw the feasible region for the linear programming relaxation of the following IP. (This is the LP obtained by

Only #3 please!! 2. (25 points) Draw the feasible
Only #3 please!!
2. (25 points) Draw the feasible region for the linear programming relaxation of the following IP. (This is the LP obtained by ignoring the integrality constraints.) Maximize 2x1 + x2 Subject to 10x1 + 10x2 5 9 10x1 + 5x2 21 X1, X2 20 X1, X2 integer. Based on your drawing of the LP relaxation, identify all feasible solutions to the IP. What is the optimal solution to the IP? 3. (25 points) Solve the IP from problem 2 above using branch-and-bound. Draw your branch-and- bound (B&B) tree and report the LP objective and solution at each node of the B&B tree. If a node in your B&B tree is pruned, explain why. Finally, give the optimal solution for the IP

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!