9. Show without using the Simplex Method that x1 = x2 = -I, x3 = §, is an optimal solution to the following linear programming problem:
Maximize z = 9×1 + 14×2 + 7×3 subject to 2×1 + x2 + 3×3 < 6 5×1 + 4×2 + x3 < 12 2×2 s 5 X1, x2, x3 unrestricted.
(Hint: Formulate the dual of this problem and then find a feasible solution.)
