Skip to main content

First order generalized optimality conditions for programming problems with a set constraint

  • Conference paper
Generalized Convexity

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 405))

Abstract

We consider three distinct mathematical programming problems, where the functions involved are differentiable (or at least continuous) and the feasible set is formed by a not necessarily open set constraint, as well as by usual equality and/or inequality constraints. With reference to the said problems necessary and sufficient first order optimality conditions are discussed; moreover a general dual formulation and some inclusion relations among constraint qualifications of old and new type are considered.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Abadie: On the Kuhn-Tucker theorem; in: Non linear programming, J. Abadie ed., Amsterdam, North-Holland, 1967, 19–36.

    Google Scholar 

  2. M. S. Bazaraa, J. J. Goode: Necessary optimality criteria in mathematical programming in the presence of differentiability, J. Math. Anal. Appl. 40, 1972, 609–621.

    Article  Google Scholar 

  3. M. S. Bazaraa, C. M. Shetty: Foundations of Optimization, Springer Verlag, Berlin, 1976.

    Google Scholar 

  4. G. Giorgi, A. Guerraggio, On the notion of tangent cone in mathematical programming, Optimization, 25, 1992, 11–23.

    Article  Google Scholar 

  5. F. J. Gould, J. W. Tolle: A necessary and sufficient qualification for constrained optimization, SIAM J. Appl. Math. 20, 1971, 164–172.

    Article  Google Scholar 

  6. F. J. Gould, J. W. Tolle: Geometry of optimality conditions and constraint qualifications, Math. Programming, 2, 1972, 1–18.

    Article  Google Scholar 

  7. M. Guignard: Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space, SIAM J. Control 7, 1969, 232–241.

    Article  Google Scholar 

  8. M. A. Hanson: On sufficiency of the Kuhn-Tucker conditions, J. Math. Anal. Appl., 80, 1981, 545–550.

    Article  Google Scholar 

  9. R. N. Kaul, S. Kaur: Optimality criteria in nonlinear programming involving nonconvex functions, J. Math. Anal. Appl. 105, 1985, 104–112.

    Article  Google Scholar 

  10. O. L. Mangasarian: Nonlinear Programming, McGraw-Hill, New York, 1969.

    Google Scholar 

  11. D. H. Martin, G. G. Watkins: Cores of tangent cones and Clarke’s tangent cone, Mathematics of Oper. Res. 10, 1985, 565–575.

    Article  Google Scholar 

  12. P. Michel, J. P. Penot: Calcul sous-différentiel pour des fonctions Lipschitziennes et non-Lipschitziennes, C. R. Acad. Sciences, Paris, Série I, Mathématique, 298, 1984, 269–272.

    Google Scholar 

  13. J. P. Penot: A characterization of tangential regularity, Nonlinear Anal. Theory, Methods and Appl. 5, 1981, 625–643.

    Article  Google Scholar 

  14. J. S. Treiman: An infinite class of convex tangent cones, J.O.T.A., 68, 1991, 563–581.

    Article  Google Scholar 

  15. C. Ursescu: Tangent sets’ calculus and necessary conditions for extremality, SIAM J. Control Optim. 20, 1982, 563–574.

    Article  Google Scholar 

  16. P. Varaiya: Nonlinear programming in Banach space, SIAM J: Appl. Math. 15, 1967, 284–293.

    Article  Google Scholar 

  17. D. Ward: Convex subcones of the contingent cone in nonsmooth calculus and optimization, Trans. Amer. Math. Soc. 302, 1987, 661–682.

    Article  Google Scholar 

  18. S. Zlobec: Asymptotic Kuhn-Tucker conditions for mathematical programming problems in a Banach space, SIAM J. Control. 8, 1970, 505–512.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giorgi, G., Guerraggio, A. (1994). First order generalized optimality conditions for programming problems with a set constraint. In: Komlósi, S., Rapcsák, T., Schaible, S. (eds) Generalized Convexity. Lecture Notes in Economics and Mathematical Systems, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46802-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46802-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57624-2

  • Online ISBN: 978-3-642-46802-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics