A machineshop makes $4$ seperate products using $5$ different workstations. Each product has a different profit level and consumes different levels of capacity in each workstation. The machine shop's problems can be formulated as the following linear program.

Generic $-$ Final.JPG

Based on this formulation set up and solve the problem in Analytic Solver to determine the optimal values for

X$1$:

$[$ Select $]$

X$2$:

$[$ Select $]$

X$3$:

$[$ Select $]$

X$4$:

$[$ Select $]$

Z

$[$ Select $]$

Document each constraint as binding or non$-$binding

Constraint $1$:

$[$ Select $]$

Constraint $2$:

$[$ Select $]$

Constraint $3$:

$[$ Select $]$

Constraint $4$:

$[$ Select $]$

Constraint $5$: