Ben has a bag with 4 green counters 4 red counters and 12 white counters Ben takes a counter from the bag at random find the pro
1 answer:
You might be interested in
Lagrangian:
where the function we want to minimize is actually
, but it's easy to see that 
and 
have critical points at the same vector 
.
Derivatives of the Lagrangian set equal to zero:
Substituting the first three equations into the fourth gives
Solving for
, we get a single critical point at 
, which in turn gives the least distance between the plane and (0, 2, 5) of 
.
where the function we want to minimize is actually
Derivatives of the Lagrangian set equal to zero:
Substituting the first three equations into the fourth gives
Solving for
Answer:
d
Step-by-step explanation:
