3. Consider the problem given below. min z = 6x + 8x s.t. 1 0 3x + x 4 x + 2x 4 X1, X = 0; x1, x integer The optimal solution to its linear relaxation is given below: Z xl x2 el e2 0 0 -4/5 -18/5 1 0 -2/5 1/5 001 1/5 -3/5 a) Create a gomory cut that solves the IP problem. (20 points) RHS 88/5 4/5 8/5 b) Build the initial tableau that you can use to solve the problem with dual simplex method (you don't need to apply the dual simplex algorithm)

3. Consider the problem given below. minz=6x1+8x2s.t.3x1+x24x1+2x24x1,x20;x1,x2integer The optimal solution to its linear relaxation is given below: a) Create a gomory cut that solves the IP problem.(20 points) b) Build the initial tableau that you can use to solve the problem with dual simplex method (you don't need to apply the dual simplex algorithm) ( 20 points) 3. Consider the problem given below. minz=6x1+8x2s.t.3x1+x24x1+2x24x1,x20;x1,x2integer The optimal solution to its linear relaxation is given below: a) Create a gomory cut that solves the IP problem.(20 points) b) Build the initial tableau that you can use to solve the problem with dual simplex method (you don't need to apply the dual simplex algorithm) ( 20 points)