Problem $9-15($Algorithmic$)$ product and the revenue generated per barrel are shown.

$\backslash$table$[[$Input$,$Cost$/$Barrel$,$Octane,Available $($barrels$)],[1,$$$16\mathrm{.}5,92,130000],[2,$$$15,85,330000],[3,$$$17\mathrm{.}5,105,320000]]$

$\backslash$table$[[,$Revenue$/$Barrel$,$Max Demand $($barrels$)],[$Regular$,$$$18\mathrm{.}5,340000],[$Super$,$$$22,490000]]$

Develop and solve a linear programming model to maximize contribution to profit.

Let $R_i=$ the number of barrels of input i to use to produce Regular, $i=1,2,3$

$S_i=$ the number of barrels of input $i$ to use to produce Super, $i=1,2,3$

If required, round your answers to two decimal places. For subtractive or negative numbers use a minus sign even if there is a $+$ sign before the blank. $($Example: $-300)$

Max

R$1$

R$2$ R$3+$ S$1+$ S$2+$ S$3$

$3$ more Check My Work uses remaining.

Previous

Next