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:
160 cars
Step-by-step explanation:
The computation of the number of more cars he washed this year is given below;
Last year, he washed 20 cars a week so on yearly basis he washed
= 20 cars × 52 weeks
= 1,040 cars
And, this year he washed 1,200 cars
So, the number of more cars he washed this year is
= 1,200 cars - 1,040 cars
= 160 cars
Answer:
6x² + 5x - 2 = 0
Step-by-step explanation:
Given
2x² - 5x - 6 = 0 ← in standard form
with a = 2, b = - 5, c = - 6, then
sum of roots α + β = - =
product of roots = = - 3, then
sum of new roots = +
=
= = -
product of new roots = ×
= = -
Hence the required equation is
x² + x - = 0 or
6x² + 5x - 2 = 0 ( multiplying through by 6 )
Answer:
anlamadım gitti gidiyor işte çalışiciyon lütfen