Question 743379
{{{x}}}= number of tables made per day
{{{y}}}= number of chairs made per day
Two obvious constraints are
{{{x>=0}}} and {{{y>=0}}}
The amount of carpentry work required per day would be
{{{2x+3y<=108}}}.
The amount of finishing work required per day would be
{{{x+0.5y<=20}}}.
The inequalities above represent our design space or feasibility region (or whatever your teacher calls it. That is the region of the x-y plane where the factory will be working, hopefully at the point of maximum profit.
We can graph that region to visualize the problem (and because the teacher wants us to do it).
{{{drawing(360,300,-10,60,-5,45,
grid(0),
blue(line(0,36,54,0)),green(line(0,40,20,0)),
locate(20,3,C),locate(1,3,O),locate(-1,38,A),
locate(3,36,B),locate(1,42,D),locate(54,3,E)
)}}} The feasibility region is the quadrilateral OABC, bounded by the lines 
{{{x=0}}} (the y-axis)
{{{y=0}}} (the x-axis)
{{{2x+3y=108}}} (the blue line) and
{{{x+0.5y=20}}} (the green line).
To plot the blue and green line, I just found the x- and y-intercepts for each one.
For {{{2x+3y=108}}}:
when {{{x=0}}}, {{{2*0+3y=108}}} --> {{{3y=108}}} --> {{{y=108/3}}} --> {{{y=36}}} gives us point A(0,36).
When {{{y=0}}}, {{{2x+3*0=108}}} --> {{{2x=108}}} --> {{{x=108/2}}} --> {{{x=54}}} gives us point E(54,0)
For {{{x+0.5y=20}}}:
when {{{x=0}}}, {{{0+0.5y=20}}} --> {{{0.5y=20}}} --> {{{y=20/0.5}}} --> {{{y=40}}} gives us point D(0,40).
When {{{y=0}}}, {{{x+0.5*0=20}}} --> {{{x=20}}} gives us point C(20,0).
The intersection of the 2 lines is the point that satisfies {{{2x+3y=108}}} and
{{{x+0.5y=20}}} <--> {{{2x+y=40}}}. It is the solution to
{{{system(2x+3y=108,2x+y=40)}}} --> {{{3y-y=108-40}}} --> {{{2y=68}}} --> {{{y=34}}} and
with {{{system(y=34,2x+y=40)}}} --> {{{2x+34=40}}} --> {{{2x=40-34}}} --> {{{2x=6}}} --> {{{x=4}}}.
That intersection is the point C(3,34).
 
The profit, as a function of {{{x}}} and {{{y}}} is the linear function
{{{P(x,y)=35x+20y}}}
The profit maximum will occur either at a vertex of that feasibility quadrilateral, or all along an edge. All we need to do is calculate {{{P}}} at all the vertices and see which vertex wins. If there is a tie, it will be between adjacent vertices, and in that case, the maximum happens all along the edge connecting those two vertices.
{{{P(0,0)=0}}}
{{{P(20,0)=700}}}
{{{P(0,36)=720}}}
{{{P(3,34)=35*3+20*34=105+680=785}}}
There should be {{{highlight(3)}}} tables and {{{highlight(34)}}} chairs made each day to maximize profit, and that would yield a profit of $785.