There are real Lagrange multipliers such thatEquivalently . The rank assumption says the two constraint gradients are linearly independent; it rules out an abnormal constraint point.
Use constraints and . Both constraints and the objective are continuously differentiable. The feasible set is a nonempty closed subset of a bounded ellipsoid, hence compact, so the extreme value theorem guarantees both extrema.
The gradients and are independent everywhere feasible. If the first were times the second, then , , . The plane constraint would give , forcing the origin, which is not on the ellipsoid. Thus the Lagrange multiplier theorem applies at every feasible point.
Articles by others on the same topic
There are currently no matching articles.