Conceptual Overview: Explore how linear programming constraints establish the feasible region.

Par, Inc. manufactures both standard and deluxe golf bags. Processes including $($a$)$ cutting and dyeing, $($b$)$ sewing, $($c$)$ finishing, and $($d$)$ inspection and $p$ bags that can be produced. For example, Par, Inc. has the resources for cutting and dyeing to make $(7/10)$th Standard bags for every Deluxe bag up to a their manufacturing process. This and the other constraints are listed below.

Initially, the graph below shows the unconstrained choices for the number of Standard and Deluxe bags to be made. Click on the graph to apply each con that some constraints reduce the feasible altemative combinations of Standard and Deluxe substantially, while other constraints are laxer and reduce the changes with each new constraint, until all the constraints have been applied. The remaining highlighted area is the feasible set.

$\backslash$table$[[(\frac{7}{10})S+1D630,$Cutting and Dyeing$],[(\frac{1}{2})S+(\frac{5}{6})D600,$Sewing$],[1S+(\frac{2}{3})D708,$Finishing$],[(\frac{1}{10})S+(\frac{1}{4})D135,$Inspection and Packaging$]]$