Question: please only solve part c) please solve m sorry have a mistake please (d) solve please 2. Consider the following integer programming (IP) problem. Maximize
please only solve part c) please solve 
m sorry have a mistake please (d) solve please
2. Consider the following integer programming (IP) problem. Maximize Subject to z = x; + 2x2 x + x, 53 - 2x + x 52 x 2x 50 X4,X, 20 X, X, are integers (a) Solve the LP-relaxation (LP without integrality restrictions) graphically. (b) Round the solution of the LP-relaxation to the nearest integer solution and check whether the solution obtained by rounding is feasible. If feasible, calculate z. Is this solution optimal for the IP problem above? (c) Use the branch and bound method to solve the IP problem optimally. (d) Use the cutting-plane algorithm to solve the IP problem optimally. Illustrate the cut on the two-dimensional graph in part (a). (e) Suppose that X, is only restricted to be integer. Use the branch and bound method to solve the IP problem optimally Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
