Skip to main content
Log in

Necessary and sufficient conditions in constrained optimization

  • Published:
Mathematical Programming Submit manuscript

Abstract

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions”,Journal of Mathematical Analysis and Applications 80 (1981) 545–550.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. A. Hanson and B. Mond, “Further generalizations of convexity in mathematical programming”,Journal of Information and Optimization Sciences (1982) 25–32.

  3. B. Mond and M. A. Hanson, “On duality with generalized convexity”,Mathematische Operationsforschung und Statistik Series Optimization 15 (1984) 313–317.

    MATH  MathSciNet  Google Scholar 

  4. O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).

    MATH  Google Scholar 

  5. M.A. Hanson, “A duality theorem in nonlinear programming with nonlinear constraints”,Australian Journal of Statistics 3 (1961) 67–71.

    Article  MathSciNet  Google Scholar 

  6. P. Huard, “Dual programs”,IBM Journal of Research and Development 6 (1962) 137–139.

    Article  MATH  Google Scholar 

  7. A. Ben-Israel and B. Mond, “What is invexity?”Journal of the Australian Mathematical Society Series B 28 (1986) 1–9.

    Article  MATH  MathSciNet  Google Scholar 

  8. R.M. Thrall and L. Tornheim,Vector Spaces and Matrices (Wiley, New York, 1957).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hanson, M.A., Mond, B. Necessary and sufficient conditions in constrained optimization. Mathematical Programming 37, 51–58 (1987). https://doi.org/10.1007/BF02591683

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation