Answer:
The combination that gives the most profit is 12 VIP rings and 12 SST rings (900 $/day).
Step-by-step explanation:
This is a linear programming problem.
The objective function is profit R, which has to be maximized.
[tex]R=40V+35S[/tex]
being V: number of VIP rings produced, and S: number of SST rings produced.
The restrictions are
- Amount of rings (less or equal than 24 a day):
[tex]V+S\leq24[/tex]
- Amount of man-hours (up to 60 man-hours per day):
[tex]3V+2S\leq60[/tex]
- The number of rings of each type is a positive integer:
[tex]V, \;S\geq 0[/tex]
This restrictions can be graphed and then limit the feasible region. The graph is attached.
We get 3 points, in which 2 of the restrictions are saturated. In one of these three points lies the combination of V and S that maximizes profit.
The points and the values for the profit function in that point are:
Point 1: V=0 and S=24.
[tex]R=40V+35S=40\cdot 0+35\cdot 24=0+840\\\\R=840[/tex]
Point 2: V=12 and S=12
[tex]R=40V+35S=40\cdot 12+35\cdot 12=480+420\\\\R=900[/tex]
Point 3: V=20 and S=0
[tex]R=40V+35S=40\cdot 20+35\cdot 0=800+0\\\\R=800[/tex]
The combination that gives the most profit is 12 VIP rings and 12 SST rings (900 $/day).