Show without using the Simplex Method that X1 3, xz = { X; = % is an optimal solution to the following linear programming problem: Maximize 2 = 9x1 14x2 Ix; subject to 2x1 Xz + 3x3 <6 Sx1 4x2 " X3 < 12 2x2 <5 X1, X2, X3 unrestricted _
(Hint: Formulate the dual of this problem and then find a feasible solution )