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:
The correct option is option (B).
He would be saving $10,485.75.
Step-by-step explanation:
We know that,
1 cent =$ 0.01.
Geometric sequence:
- The first term of the sequence be a and common ratio n, then
term of the sequence is 
. - The sum of the sequence is
where r>1
where r<1
=na where r=1
Here first term(a)= $0.01, r= 2 , n=20
=10,485.75
He would be saving $10,485.75.
Answer:
12
Step-by-step explanation:
Well the way i said it was
-
42-30= 12
altho i not very sure
Beginning with the function y = sin x, which would have range from -1 to 1 and period of 2pi:
Vertical compression of 1/2 compresses the range from -1/2 to 1/2
Phase shift of pi/2 to the left
Horizontal stretch to a period of 4pi, as the crests are at -4pi, 0, 4pi
Vertical shift of 1 unit up moves the range to 1/2 to 3/2
So the first choice looks like a good answer.
