Quantitative Analysis

Chapter $7$Introduction to Linear Programming

Assignment$$A Minimization problem

Consider the following linear programming problem

$\{\begin{array}{ccc}\text{:}[& \text{M}\text{i}\text{n},8S& 3M]\\ & s.t.& ,\\ ,& 50S& 100M\\ ,& 5S& 4M\end{array}lrer,1,200,000$

$S,M,0$

a$$Write the problem in standard form$$

b$$Use a graph to show each constraint and the feasible region$$

c$$Identify the optimal solution point on your graph$$What are the values of S and M at the optimal solution$$

d$$What is the optimal value of the objective function$$

e$$What are the values of slack and surplus variables at the optimal solution$$