Question: 4. Consider the following integer programming (IP) problem. Maximize Z = 3X + 2X s.t. 4X + 2X 45 2X + 3X 38 X
4. Consider the following integer programming (IP) problem. Maximize Z = 3X + 2X s.t. 4X + 2X 45 2X + 3X 38 X + X 15 X, X 20 X, X, are integers (a) Solve the LP relaxation graphically. (b) Use the cutting plane algorithm to solve the IP problem optimally.
Step by Step Solution
There are 3 Steps involved in it
a To solve the LP relaxation graphically we first ignore the integer constraints X1 X2 0 and solve t... View full answer
Get step-by-step solutions from verified subject matter experts
