SOLUTION: The ACME company makes two types of rings: the VIP and the SST. They can produce up to 24 rings every day using up to 60 total man-hours. It takes 3 man-hours to make one VIP rin

Algebra ->  Coordinate-system -> SOLUTION: The ACME company makes two types of rings: the VIP and the SST. They can produce up to 24 rings every day using up to 60 total man-hours. It takes 3 man-hours to make one VIP rin      Log On


   



Question 1134444: The ACME company makes two types of rings: the VIP and the SST. They can produce up
to 24 rings every day using up to 60 total man-hours. It takes 3 man-hours to make one VIP
ring and 2 man-hours to make one SST ring. How many of each type of ring should be made
daily to maximize the company’s profit if the profit on the VIP ring is $40 and on the SST ring is
$35. Show the graph, all equations and work.
Thank you!

Answer by ikleyn(52787) About Me  (Show Source):
You can put this solution on YOUR website!
.
Let  X = # of the VIP rings, and

     Y = # of the SST rings.


Then the problem is to maximize the objective (=the profit) function  

    P(X,Y) = 40X + 35Y

under these restrictions

    X + Y <= 24,

    3X + 2Y <= 60,

    X >= 0,  Y >= 0.


The feasibility domain is shown at the plot below.


    


    Plot X + y = 24 red),  3x + 2y = 60 (green)



It is the quadrilateral in QI under the red and green lines.


Corner points are  

     P1 = (0,24)     (red line y-interception);

     P2 = (12,12)    (intersection the red and the green lines);

     P3 = (20,0)     (green line x-interception).


Calculate the profit function at the corner points


     P1:  P(0,24)  = 40*0  + 35*24 = 840;

     P2:  P(12,12) = 40*12 + 35*12 = 900;

     P3:  P(20,0)  = 40*20 + 35*0  = 800.


The maximum value is at P2.

Hence, the solution is the point P2 with  X= 12 (the number of the VIP rings)  and  Y = 12 (the number of the SST rings)  

                       and the profit value of  900 dollars.    ANSWER

Solved.

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

To see other similar problems solved by the Linear Programming method,  look into the lesson
    - Solving minimax problems by the Linear Programming method
in this site.

Also,  look into the solutions of other similar problems in the archive to this forum under the links

https://www.algebra.com/algebra/homework/Graphs/Graphs.faq.question.1131906.html
https://www.algebra.com/algebra/homework/coordinate/word/Linear_Equations_And_Systems_Word_Problems.faq.question.1131043.html
https://www.algebra.com/algebra/homework/word/finance/Money_Word_Problems.faq.question.1129285.html
https://www.algebra.com/algebra/homework/Finance/Finance.faq.question.1128383.html
https://www.algebra.com/algebra/homework/Linear-equations/Linear-equations.faq.question.1123217.html
https://www.algebra.com/algebra/homework/Finance/Finance.faq.question.1102103.html

/\/\/\/\/\/\/\/


I want to remind you that as an educated visitor, you MUST express your thanks to EACH the solution
that I produce in response to your request.


I forced to make this reminder because MANY (if not all) visitors IGNORE THIS RULE. Unfortunately.

Which I consider as an extreme degree of discourtesy.