P Answer the following questions. Consider the following L.P. problems: min { { s.t. Ax=b Dx=p X0 P2 min CX s.t. Ax=b x > 0 Suppose x, x are optimal solutions and x is a non-optimal solution of P. Say True, False or Maybe to the following. Give a brief explanation; treat each case independently. i) The point x0 = (0.25) x + (0.75) x is another optimal solution for P. ii) The point x0 = (0.25) x + (0.25) x + (0.50) x3 is another feasible solution for P. iii) The optimal value of problem P2 is unbounded. iv) Problem P2 is inconsistent. v) U = c x is a Upper Bound for the optimal value of problem P2. b) (12 pts) Consider the application of Branch & Bound (B-B) procedure to the integer programming problem, P3: {min e x; subject to A x=b, x 0, x integer} Suppose a last subset, say S, is being investigated (with all other subsets of solutions having been eliminated at earlier iterations) and the optimal solution, x*, of the Relaxed Problem on this subset turns out to be an integer solution. Say True, False or Maybe to the following statements. Support your answer with a brief explanation. Treat each case independently. i) U = cx*, is the optimal value of P3; ii) Subset, S, is also eliminated from further consideration and B-B procedure terminates; iii) The B-B procedure continues by dividing the subset, S, into further subsets. iv) There are no "integrality constraints" in the "Relaxed Problem".