Section A
Q1.
(d) Prove that the linear programming problem Maximize z = 3x1 + 2x2 subject to the constraints : 2x1 + x2 ≤ 2 3x1 + 4x2 ≥ 12 x1, x2 ≥ 0 does not admit an optimum basic feasible solution.
(e) Compute the integral ∮ (1 + 2z + z2)/((z-1)2(z + 2))dz where C is |z| = 3.