Answer:
The maximum profit is reached with 4 deluxe units and 6 economy units.
Step-by-step explanation:
This is a linear programming problem.
We have to optimize a function (maximize profits). This function is given by:
being D: number of deluxe units, and E: number of economy units.
The restrictions are:
- Assembly hours: 
- Paint hours: 
Also, both quantities have to be positive:
We can solve graphically, but we can evaluate the points (D,E) where 2 or more restrictions are saturated (we know that one of this points we will have the maximum profit)
The maximum profit is reached with 4 deluxe units and 6 economy units.
Answer: Centroid
<u>Step-by-step explanation:</u>
Medians intersect at the CENTROID
Altitudes intersect at the Orthocenter
Perpendicular bisectors intersect at the Circumcenter
Angle bisectors intersect at the Incenter
4.8 x 10^-2
You can do this without a calculator
Explanation:
(3.2 x 10^-5) x (1.5 x 10^3)
First, you multiply 3.2 by 1.5 to get 4.8
Next, you add the exponents together: -5 + 3 = -2
Now, put everything into one answer (the 10 stays the same): 4.8 x 10^-2
I'll do the first graph.
We can easily find the y intercept by inputting 0 for x.
y = -2(0) + 7
y = 7
The y-intercept is (0, 7)
To find the x intercept, isolate x.
y = -2x + 7
Add 2x to both sides.
2x + y = 7
Subtract y from both sides.
2x = -y + 7
Divide by 2 on both sides.
x = -1/2y + 3.5
Input 0 for y.
x = -1/2(0) + 3.5
x = 3.5
The x intercept is (3.5, 0)
Now try the rest own your own! :)
