Question $9$

Consider the following linear programming problem, which maximizes profit for two products: regular $($R$)$ and super $($S$)$:

MAX $5$R $+75$S

s$.$t$.$

$1\mathrm{.}2$ R $+1\mathrm{.}6$ S assembly $($hours$)$

$0\mathrm{.}8$R$+0\mathrm{.}5$S paint $($hours$)$

$0\mathrm{.}16$R$+0\mathrm{.}4$S inspection $($hours$)$

R$,$S$>=0$R