Chapter 6.3, Problem 11E

In Problems 11 and 12, a minimization problem, the corresponding dual problem, and the final simplex tableau in the solution of the dual problem are given.

(A) Find the optimal solution of the dual problem.

(B) Find the optimal solution of the minimization problem.

$\begin{array}{l}\text{Minimize }C=21x_1+50x_2\\ \text{subject to }2x_1+5x_2\ge 12\\ 3x_1+7x_2\ge 17\\ x_1,x_2\ge 0\\ \text{Maximize }P=12y_1+17y_2\\ \text{subject to }2y_1+3y_2\le 21\\ 5y_1+7y_2\le 50\\ y_1,y_2\ge 0\\ y_1{y}_2{x}_1{x}_{2}P\\ \left[\begin{array}{cccccc}0& 1& 5& -2& 0& 5\\ 1& 0& -7& 3& 0& 3\\ 0& 0& 1& 2& 1& 121\end{array}\right]\end{array}$