On sufficient optimality conditions for a quasiconvex programming problem

Abstract

Some remarks are made on a paper by Bector, Chandra, and Bector (see Ref. 1) concerning the Fritz John and Kuhn-Tucker sufficient optmality conditions as well as duality theorems for a nonlinear programming problem with a quasiconvex objective function.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Bector, C. R., Chandra, S., andBector, M. K.,Sufficient Optimality Conditions and Duality for a Quasiconvex Programming Problem, Journal of Optimization Theory and Applications, Vol. 59, pp. 209–221, 1988.

    Google Scholar 

  2. 2.

    Skarpness, B., andSposito, V. A.,A Modified Fritz John Optimality Criterion, Journal of Optimization Theory and Applications, Vol. 31, pp. 113–115, 1980.

    Article  Google Scholar 

  3. 3.

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

    Google Scholar 

  4. 4.

    Crouzeix, J. P., andFerland, J. A.,Criteria for Quasiconvexity and Pseudoconvexity: Relationships and Comparisons, Mathematical Programming, Vol. 23, pp. 193–205, 1982.

    Article  Google Scholar 

  5. 5.

    Giorgi, G.,A Note on Quasiconvex Functions That Are Pseudoconvex, Trabajos de Investigacion Operativa, Vol. 2, pp. 80–83, 1987.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

This research was supported by the Italian Ministry of University Scientific and Technological Research.

Communicated by F. Giannessi

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Giorgi, G. On sufficient optimality conditions for a quasiconvex programming problem. J Optim Theory Appl 81, 401–405 (1994). https://doi.org/10.1007/BF02191671

Download citation

Key Words

  • Generalized convexity
  • Fritz John and Kuhn-Tucker sufficient optimality conditions