The constraint intersection is nonempty, closed and bounded, hence compact, so extrema exist. The two constraint gradients are and . If the first were times the second, the plane condition would give , so and all coordinates would vanish, contradicting the ellipsoid equation. Their rank is therefore two at every feasible point, justifying the Lagrange multiplier equations.
These equations are
Eliminating gives and . The first equation makes ; subtracting twice the first from the second forces . Hence , and the ellipsoid gives . Thus
All candidates were found, and compactness ensures they include the extrema.

Articles by others on the same topic (0)

There are currently no matching articles.