Answer:
The objective function in terms of one number, x is
S(x) = 4x + (12/x)
The values of x and y that minimum the sum are √3 and 4√3 respectively.
Step-by-step explanation:
Two positive numbers, x and y
x × y = 12
xy = 12
S(x,y) = 4x + y
We plan to minimize the sum subject to the constraint (xy = 12)
We can make y the subject of formula in the constraint equation
y = (12/x)
Substituting into the objective function,
S(x,y) = 4x + y
S(x) = 4x + (12/x)
We can then find the minimum.
At minimum point, (dS/dx) = 0 and (d²S/dx²) > 0
(dS/dx) = 4 - (12/x²) = 0
4 - (12/x²) = 0
(12/x²) = 4
4x² = 12
x = √3
y = 12/√3 = 4√3
To just check if this point is truly a minimum
(d²S/dx²) = (24/x³) = (8/√3) > 0 (minimum point)
Answer:
163
Step-by-step explanation:
vertical angles are congruent
Answer:
100
Step-by-step explanation:
<h3>
Answer: 625</h3>
Work Shown:
The set {A,B,C,1,2} has five items. There are four slots to fill.
So we have 5^4 = 5*5*5*5 = 625 different possible passwords where the characters can be repeated.
Answer:
i cant really see it but i think the answer is 5
Step-by-step explanation:
when you look at the graph go to where x is 2 then keep going up and whatever point it hits thats the answer
