The linear programming model that can be used to solve this problem is as follows:

Min

s$.$t$.$

$10$AM $1$

$1$AM $1$

$4$AM $1$

$6$AM $1$

$6$BM

$1$BM

$3$BM

$8$BM

$1$

$1$

$1$

$14$AP $1$

$1$AP $1$

$9$BP

$1$BP

$5100$

$5150$

# $600$

# $1080$

Demand for model A

Demand for model B

Injection molding time

Assembly time

AM$,$ BM$,$ AP$,$ BP $ $0$

The computer solution is shown in Figure $3\mathrm{.}18.$ LO $2,3,5$

a$.$ What is the optimal solution and what is the optimal value of the objective function?

b$.$ Which constraints are binding?

c$.$ What are the dual values? Interpret each.

d$.$ If you could change the right$-$hand side of one constraint by one unit, which one

would you choose? Why?