Codex Wiki OurBigBook logoOurBigBook.comSite Source code
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.
Write
The unconstrained maximizer of on the disc violates , so both boundaries are active at the optimum. Their intersections are
and gives the smaller objective.
To certify it, at choose
Then
both multipliers are nonnegative, and complementary slackness holds because both constraints are active. The sufficiency theorem therefore gives
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 7H
  2. Paper 2
  3. Ib
  4. 2022
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home