Solve the following integer programming model by using the branch and bound algorithm and LIFO approach. You have to apply the dual simplex algorithm in every iteration (graphical solutions will not be accepted). The optimum table of the LP relaxation is as given. You have to explain your work in detail. At the end, write the optimal solution explicitly. 2 X1 X2 S1 S2 rhs 1006/ 75/14 100/7 Max z=7X1+4x2 0 1 5/7 -2/ 7 18/7 s.t. 4x1+3x2 0, and X1, X2 are integer Hint: In the first sub-problem, define the branches for X1. It is sufficient to find only one optimal solution. Solve the integer programming model given in Problem 1 by using the cutting-plane algorithm. You have to apply the dual simplex algorithm in every iteration (graphical solutions will not be accepted). You have to explain your work in detail. At the end, write the optimal solution explicitly. Hint: If there are multiple candidate rows to write the new constraint, always choose the row where x1 or X2 is the basic variable. If the rows, where X1 and X2 are basic, are both candidates, choose the row where Xi is basic. Solve the integer programming model given in Problem 1 by using the cutting-plane algorithm. You have to apply the dual simplex algorithm in every iteration (graphical solutions will not be accepted). You have to explain your work in detail. At the end, write the optimal solution explicitly. Hint: If there are multiple candidate rows to write the new constraint, always choose the row where x1 or X2 is the basic variable. If the rows, where X1 and X2 are basic, are both candidates, choose the row where x1 is basic