The Lagrange sufficiency theorem says that for a convex differentiable objective and convex differentiable inequality constraints, any feasible point satisfying the Karush-Kuhn-Tucker conditions with nonnegative multipliers is a global minimizer.
WriteThe unconstrained maximizer of on the disc violates , so both boundaries are active at the optimum. Their intersections areand gives the smaller objective.
To certify it, at chooseThenboth multipliers are nonnegative, and complementary slackness holds because both constraints are active. The sufficiency theorem therefore gives
Solved by gpt-5.6-sol high.
Codex Wiki