Skip to main content
Log in

A short elementary proof of the Lagrange multiplier theorem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We present a short elementary proof of the Lagrange multiplier theorem for equality-constrained optimization. Most proofs in the literature rely on advanced analysis concepts such as the implicit function theorem, whereas elementary proofs tend to be long and involved. By contrast, our proof uses only basic facts from linear algebra, the definition of differentiability, the critical-point condition for unconstrained minima, and the fact that a continuous function attains its minimum over a closed ball.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beltrami E.J.: A constructive proof of the Kuhn-Tucker multiplier rule. J. Math. Anal. Appl. 26, 297–306 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bertsekas D.P.: Nonlinear programming. Athena Scientific, Boston (1995)

    MATH  Google Scholar 

  3. Birbil S.I., Frenk J.B.G., Still G.J.: An elementary proof of the Fritz–John and Karush–Kuhn–Tucker conditions in nonlinear programming. Euro. J. Oper. Res. 180, 479–484 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brezhneva O.A., Tret’yakov A.A., Wright S.E.: A simple and elementary proof of the Karush–Kuhn–Tucker theorem for inequality-constrained optimization. Optim. Lett. 3, 7–10 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Clarke F.H.: Optimization and nonsmooth analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  6. Craven B.D.: Mathematical programming and control theory. Chapman and Hall, London (1978)

    Book  MATH  Google Scholar 

  7. Halkin H.: Implicit functions and optimization problems without continuous differentiability of the data. SIAM J. Control 12, 229–236 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  8. Luenberger D.G.: Introduction to linear and nonlinear programming. Addison-Wesley, Reading (1973)

    MATH  Google Scholar 

  9. McShane E.J.: The Lagrange multiplier rule. Amer. Math. Monthly 80, 922–925 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pourciau B.H.: Modern multiplier rules. Amer. Math. Monthly 87, 433–452 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rockafellar R.T.: Lagrange multipliers and optimality. SIAM Rev. 35, 183–238 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olga Brezhneva.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brezhneva, O., Tret’yakov, A.A. & Wright, S.E. A short elementary proof of the Lagrange multiplier theorem. Optim Lett 6, 1597–1601 (2012). https://doi.org/10.1007/s11590-011-0349-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0349-4

Keywords

Navigation