<PRE><B>Question 1131675</B>
&lt;br&gt;
Let x = number of coffee tables
let y = number of bookcases&lt;br&gt;
varnish constraint: x+y &lt;=10
wood constraint: x+2y &lt;= 12&lt;br&gt;
and of course x &gt;=0 and y &gt;= 0&lt;br&gt;
Graph the constraint boundary lines to determine the feasibility region:&lt;br&gt;
{{{graph(400,400,-2,14,-2,14,10-x,6-.5x)}}}&lt;br&gt;
The corners of the feasibility region are (0,0), (0,6), (8,2), and (10,0).&lt;br&gt;
Evaluate the objective function at each corner:&lt;br&gt;
(0,0): 9(0)+12(0) = 0
(0,6): 9(0)+12(6) = 72
(8,2): 8(9)+2(12) = 96
(10,0): 10(9)+0(12) = 90&lt;br&gt;
The maximum profit is $96, when 8 coffee tables and 2 bookcases are built.&lt;br&gt;
Note as a refinement of this process, you can determine the corner of the feasibility region with the maximum profit without evaluating the objective function at every corner.  The corner with the maximum profit can be found by comparing the slopes of the constraint lines and the objective function.&lt;br&gt;
In this problem, the constraint lines have slopes of -1 and -.5; the objective function has a slope of -.75.  Because the slope of the objective function is between the slopes of the two constraint lines, the maximum profit will be at the intersection of the two constraint lines.&lt;br&gt;
In more complex linear programming problems, where the feasibility region has several corners, this can save a lot of time in finding the answer.</PRE>