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

MAX $5R+75S$

$s.t.$

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

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

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

$R,S0$

See the sensitivity report provided below:

Variable Cells

$\backslash$table$[[$Cell$,$Name,$\backslash$table$[[$Final$],[$Value$]],\backslash$table$[[$Reduced$],[$Cost$]],\backslash$table$[[$Objective$],[$Coefficient$]],\backslash$table$[[$Allowable$],[$increase$]],\backslash$table$[[$Alowable$],[$Decrease$]]],[$SCS$2$B$,$Regular $-$ R$,0,-25,5,25,1E+30$