Question 1123217
<pre>

Let X be the number of tables;

let Y be the number of chairs.


The objective function (profit)  is

R(X,Y) = 200X + 100Y.


The restrictions are :

50X + 20Y <= 3300       (1)     (restriction on board feet of lumber)   and
 3X +  4Y <=  380       (2)     (restriction on labor time).
X >= 0;  Y >= 0.        (3)     (non-negativity).


You need to maximize the objective function (profit) under given restrictions.


The feasible domain is shown below.


It is  a quadrilateral in the first quadrant  (X >= 0,  Y >= 0)  restricted 
by the red line  50X + 20Y = 3300  and the green line  3X + 4Y = 380.



{{{graph( 330, 330, -20, 100, -20, 200,
          (3300-50x)/20,  (380-3x)/4
)}}}


Plots Y = {{{(3300-50X)/20}}}  (red) and y = {{{(380-3x)/4}}} (green)



The method of linear programming says:

&nbsp;&nbsp;&nbsp;&nbsp;1) Take the vertices of this quadrilateral

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(X1,Y1) = (0,95)    (green line Y-intercept);

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(X2,Y2) = (40,65)   (intersection point of the straight lines Y = {{{(3300-50X)/20}}} and Y = {{{(380-3x)/4}}} );
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(X3,Y3) = (66,0)    (red line X-intercept)


&nbsp;&nbsp;&nbsp;&nbsp;2) Calculate the objective function at these points

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;R(X1,Y1) = 200*0 + 100*95   =  9500;

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;R(X2,Y2) = 200*40 + 100*65  =  14500;

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;R(X3,Y3) = 200*66 + 100*0   =  13200.


&nbsp;&nbsp;&nbsp;&nbsp;3) Then select one of these points where the objective function is maximal - In our case this point is (X2,Y2) = (40,65).


&nbsp;&nbsp;&nbsp;&nbsp;4) This point gives your optimal solution X = 40 tables  and Y = 65 chairs.


If they follow this optimal solution, their profit will be MAXIMAL, $14500.
</pre>

Solved.


------------------


For many other similar solved problems see the lesson

&nbsp;&nbsp;&nbsp;&nbsp;- <A HREF=https://www.algebra.com/algebra/homework/word/misc/Solving-minimax-problems-by--the-Linear-Programming-method.lesson>Solving minimax problems by the Linear Programming method</A> 

in this site.


Learn from there the technique and the methodology on how to solve minimax problems using the Linear Programming method - once and for all.