Ummm this has to be in your textbook
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).
Answer:
31536000 seconds in a year
Step-by-step explanation:
there are 365 days in a year, 24 hours in a day, 60 minutes in an hour, and 60 seconds in each minute. you have to multiply all of them
Answer:
27/4
Step-by-step explanation:
2x + 8 - 8y
2x - 8y + 8
2 * (1/8) - [ 8 * (3/16)] +8
(1/4) - (3/2) + 8
Answer:
B and D
Step-by-step explanation:
A is not a intersecting angles they are like doodles, B makes intersecting lines, C doesnt intersect properly its only like a Y with and extra angle and D is absolutely perfect. So, thats why its B and D