Skip to main content
Log in

A generalized Lagrangian function and multiplier method

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

As is well known, a saddle point for the Lagrangian function, if it exists, provides a solution to a convex programming problem; then, the values of the optimal primal and dual objective functions are equal. However, these results are not valid for nonconvex problems.

In this paper, several results are presented on the theory of the generalized Lagrangian function, extended from the classical Lagrangian and the generalized duality program. Theoretical results for convex problems also hold for nonconvex problems by extension of the Lagrangian function. The concept of supporting hypersurfaces is useful to add a geometric interpretation to computational algorithms. This provides a basis to develop a new algorithm.

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. Gould, F. J.,Extensions of Lagrange Multipliers in Nonlinear Programming, SIAM Journal on Applied Mathematics, Vol. 17, No. 6, 1969.

  2. Gould, F. J.,Nonlinear Pricing: Application to Concave Programming, Operations Research, Vol. 19, No. 4, 1971.

  3. Roodf, J. D.,Generalized Lagrange Functions and Mathematical Programming, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, 1969.

    Google Scholar 

  4. Arrow, K. J., Hurwitz, L., andUzawa, H.,Studies in Linear and Nonlinear Programming, Stanford University Press, Stanford, California, 1958.

    Google Scholar 

  5. Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, No. 5, 1969.

  6. Miele, A., Moseley, P. E., Levy, A. V., andCoggins, G. M.,On the Method of Multipliers for Mathematical Programming Problems, Journal of Optimization Theory and Applications, Vol. 10, No. 1, 1972.

  7. Everett, H.,Generalized Lagrange Multiplier Method for Solving Problems of Optimal Allocation of Resources, Operations Research, Vol. 11, No. 3, 1963.

  8. Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.

    MATH  Google Scholar 

  9. Morrison, P. D.,Optimization by Least Squares, SIAM Journal on Numerical Analysis, Vol. 5, No. 1, 1968.

  10. Lasdon, L. S.,Optimization Theory for Large Systems, The Macmillan Company, London, England, 1970.

    MATH  Google Scholar 

  11. Sayama, H., Kameyama, Y., Nakayama, H., andSawaragi, Y.,The Generalized Lagrangian Functions for Mathematical Programming Problems, Institute for Systems Design and Optimization, Kansas State University, Working Report No. 55, 1974.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by A. V. Balakrishnan

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nakayama, H., Sayama, H. & Sawaragi, Y. A generalized Lagrangian function and multiplier method. J Optim Theory Appl 17, 211–227 (1975). https://doi.org/10.1007/BF00933876

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00933876

Key Words

Navigation