Skip to main content
Log in

Quasi-convex programming revisited

  • Published:
CALCOLO Aims and scope Submit manuscript

Summary

The paper by S. Mititelu [8] is revisited, giving correct proofs of both necessary and sufficient conditions for the existence of solutions to a quasi-convex mathematical programming problem. The usual constraint qualifications established for such a problem, are then further weakened.

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. K. J. ArrowA. C. Enthoven,Quasi-concave Programming, Econometrica,29 (1961), 779–800.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. J. ArrowL. HurwiczH. Uzawa,Constraint Qualifications in Maximization Problems, Naval Res. Logist. Quart.,8, (1961), 175–191.

    MATH  MathSciNet  Google Scholar 

  3. M. S. BazaraaJ. J. Goode, C. M. Shetty,Constraint Qualifications Revisited, Management Sci.,18, (1972), 567–573.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Dragomirescu,Sur la nécessité des conditions de Kuhn et Tucker, C. R. Acad. Sci. Paris, Série A, (1967), 1073–1075.

  5. J. A. Ferland,Mathematical Programming Problems with Quasi-convex Objective Functions, Math. Programming,3, (1972), 296–301.

    Article  MATH  MathSciNet  Google Scholar 

  6. H. W. KuhnA. W. Tucker,Nonlinear Programming, in: J. Neyman (Ed.), Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, 1951, 481–492.

    Google Scholar 

  7. O. L. Mangasarian,Nonlinear Programming, (1969), McGraw-Hill Book Co., New York.

    MATH  Google Scholar 

  8. S. Mititelu,Kuhn-Tucker Conditions for Nonlinear Programmes with Quasi-convex Constraints, Rev. Roumaine Math. Pures Appl.,21, (1976), 903–909.

    MATH  MathSciNet  Google Scholar 

  9. C. Resina,Condizioni necessarie e sufficienti per un problema di programmazione non lineare, Calcolo,15, (1978), 161–169.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

I thank two anonymous referees for some useful suggestions on the first version of the present paper; any responsibility is however solely mine.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giorgi, G. Quasi-convex programming revisited. Calcolo 21, 307–316 (1984). https://doi.org/10.1007/BF02576169

Download citation

  • Issue Date:

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

Keywords

Navigation