Question: Please solve this. 4. {12 points} Considering the following integer programming problem max .2 2 11 + 2-1-2 llllji-PIET in 1'1 + 3.1-; IA I
Please solve this.

4. {12 points} Considering the following integer programming problem max .2 2 11 + 2-1-2 llllji-PIET in 1'1 + 3.1-; IA I 1:} .L'| + 1'2 Ll- .r1 + .1\"; S [3 4.1.13 3: [Il integer If the optimal tableau to the LP relaxation is {1}. If we want to solve the problem using the cutting plane method, what is the cut that should be added? {Just show the out} {2 point} {2}. Show your branch and bound tree and state what is the optimal solution you get applying the branch and bound method: {Giving an optimal solution without work shown will receive almost no credit] {10 points]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
