Examples from Constrained extrema
All examples from Constrained extrema.
Re-solving the disk problem with multipliers
Optimise
subject to
The gradients are
The multiplier equations are
After dividing the first two equations by ,
The unit-circle constraint rules out , so the coefficient matrix must have determinant zero:
Thus or .
If , then . The constraint gives , so the two same-sign points
give .
If , then . The two opposite-sign points
give . This reproduces the boundary part of the closed-disk example, found there by parameterisation.
The closest point on a plane
Find the point on
closest to
The plane has normal vector
The shortest segment from to the plane is perpendicular to the plane, so the desired point has the form
Substituting into the plane equation gives
so and . Therefore
This nearest point is the orthogonal projection of onto the plane. The same point results from minimising
subject to , but the normal direction makes the geometric solution shorter.
Closest and furthest points on a quartic curve
Find the points on
that are closest to and furthest from the origin. Minimise and maximise
Both expressions depend only on and . Set
The problem becomes optimising subject to
At an interior constrained extremum in the first quadrant,
The two components on the right must be equal, so
Substituting into the constraint gives
and hence .
The boundary cases in the first quadrant are or . The constraint then gives the other variable as , so . The feasible set in is closed and bounded and these interior and boundary cases exhaust its extrema. Restoring the signs independently, the closest points are
with distance , while the furthest points are
with distance .
The closest point on a parabola
Let
and find the point on closest to . A point on the parabola is
The squared distance is
Differentiate:
The stationary values satisfy
The second possibility exists only when . Since as , compare the stationary candidates:
whereas at ,
Their difference is
Therefore, if , the closest point is
If , the two closest points are
At the two non-zero candidates merge with the origin.
[challenge]