Question 200312
<font face="Garamond" size="+2">


Sawing criteria:  *[tex \Large 2x + y \leq 10].  That is the time spent sawing to make tables plus the time spent sawing to make chairs must be less than or equal to the total amount of time available for sawing.


Assembly criteria:  *[tex \Large 2x + 3y \leq 12].  That is the time spent assembling tables plus the time spent assembling chairs must be less than or equal to the total amount of time available for assembly.


Non-negative criteria:  *[tex \Large x \geq 0] and *[tex \Large y \geq 0].  You can't make a negative amount of either chairs or tables.


You might also want to restrict the solution for this problem to the integers.  Making half a table doesn't seem to make much practical sense.  And one of the critical points which may end up being an optimum based on how you define your objective function is the intersection of the two labor resource criterion inequalities, specifically the point (4.5,1).  This would suggest that a potential optimum solution could, in fact, be making 4 and a half tables.


{{{drawing(
500, 500, -1, 14, -1, 14,
grid(1),
locate(1,2,feasible),
locate(1,1.5,area),
graph(
500, 500, -1, 14, -1, 14,
-2x + 10,
(-2/3)x + 4
))}}}


You need to shade the feasible area, namely that area bounded by the green line on top, the red line on the right, and the two coordinate axes.



John
*[tex \LARGE e^{i\pi} + 1 = 0]
</font>