The Answer is C
Change fraction to improper = 16*11=176 + 3 =179 Fraction= 179/16
Divide 124/16 = 11.1875
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.
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):
- Amount of man-hours (up to 60 man-hours per day):
- The number of rings of each type is a positive integer:
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.
Point 2: V=12 and S=12
Point 3: V=20 and S=0
The combination that gives the most profit is 12 VIP rings and 12 SST rings (900 $/day).
I don't know if this is right for sure but I think that it's 81.25%.
The answer is: 41.256 (You round it to the number that you're required to round it)