2) Consider the problem: MaxZ=-4x, +5x, s.t. -3x, +3x, 56 2x, +4x, 512 X, X, 20 The final optimal simplex tableau for the problem if it is solved as a continuous linear problem is given by: 1/9 1/6 Basic z X X: Si S: Solution z 1 0 0 13/9 1/6 32/3 X2 0 0 1 8/3 X 0 1 0 -2/9 1/6 2/3 Using the cutting plane algorithm, solve the above problem: (a)Assuming that x1,x2 are non-negative integers. (b)Assuming that x1,x2 are non-negative and that xi is the only integer variable. 3) Consider the problem: MaxZ = X, + 2x2 s.t. X, +2x, 512 4x, +3x, 314 X, X, 20 and integers The final optimal simplex tableau for the problem if it is solved as a continuous linear problem is given by: X2 Basic z X S z 1 8/3 0 0 Si 0 -5/3 0 1 X2 0 4/3 1 0 Using the cutting plane algorithm, solve the above problem S2 2/3 -2/3 1/3 Solution 28/3 8/3 14/3