egression$-1$

PV Place $|$ PVAMU $|--|$

Students $-$ pvamu.e

Extra Credit Assignn

Extra Credit Assignn

Press

$^BF$

to exit full screen

New

$1/1$

$100\%$

neger programming model that could be used to find the minimum number of locations necessary to provide coverage to all areas.

b$.$ Solve the problem in part $($a$).$

$8.$ Multi$-$product Production Planning. Hart Manufacturing makes three products. Each product requires manufacturing operations in three departments: A$,$ B$,$ and C$.$ The labor$-$hour requirements, by department, are as follows:

$\backslash$table$[[$Department$,$Product $1,$Product $2,$Product $3],[$A$,1\mathrm{.}50,3\mathrm{.}00,2\mathrm{.}00],[$B$,2\mathrm{.}00,1\mathrm{.}00,2\mathrm{.}50],[$C$,0\mathrm{.}25,0\mathrm{.}25,0\mathrm{.}25]]$

During the next production period the labor$-$hours available are $450$ in department A$,350$ in department B$,$ and $50$ in department C$.$ The profit contributions per unit are $$25$ for product $1,$ $$28$ for product $2,$ and $$30$ for product $3.$

a$.$ Formulate a linear programming model for maximizing total profit contribution.

b$.$ Solve the linear program formulated in part $($a$).$ How much of each product should be produced, and what is the projected total profit contribution?