(Solved): question 7 Use the simplex method to solve the linear programming problem. \[ \begin{array}{l} \text ...

Use the simplex method to solve the linear programming problem. \[ \begin{array}{l} \text { Minimize } w=5 y_{1}+3 y_{2} \\ \text { subject to: } 2 y_{1}+3 y_{2} \geq 9 \\ 2 y_{1}+y_{2} \geq 11 \\ y_{1} \geq 0, y_{2} \geq 0 \end{array} \] A. 27 when \( y_{1}=5 \) and \( y_{2}=1 \) B. 33 when \( y_{1}=11 \) and \( y_{2}=0 \) C. 25 when \( y_{1}=2 \) and \( y_{2}=55 \) D. \( 27.5 \) when \( y_{1}=5.5 \) and \( y_{2}=0 \)