Chapter 6.3, Problem 13E

In Problems 13-20,

(A) Form the dual problem.

(B) Find the solution to the original problem by applying the simplex method to the dual problem.

$\begin{array}{l}\text{Minimize }C=9x_1+2x_2\\ \text{subject to }4x_1+x_2\ge 13\\ 3x_1+x_2\ge 12\\ x_1,x_2\ge 0\end{array}$