Chapter 6.4, Problem 25E

Problems 25-32 are mixed. Some can be solved by the methods presented in Sections 6.2 and 6.3 while others must be solved by the big $M$ method.

$\begin{array}{l}\text{Minimize }C=10x_1-40x_2-5x_3\\ \text{subject to }{x}_1+3x_2\le 6\\ 4x_2+x_3\le 3\\ x_1,x_2,x_3\ge 0\end{array}$