Skip to main content
SpringerLink
Log in

On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case

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

Abstract

Some versions of constraint qualifications in the semidifferentiable case are considered for a multiobjective optimization problem with inequality constraints. A Maeda-type constraint qualification is given and Kuhn–Tucker-type necessary conditions for efficiency are obtained. In addition, some conditions that ensure the Maeda-type constraint qualification are stated.

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

Access this article

Log in via an institution

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. Maeda, T., Constraint Qualifications in Multiobjective Optimization Problems: Differentiable Case, Journal of Optimization Theory and Applications, Vol, 80, pp. 483–500, 1994.

    Google Scholar 

  2. Kuhn, H. W., and Tucker, A. W., Nonlinear Programming, Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, California, pp. 481–492, 1952.

    Google Scholar 

  3. Yu, P. L., Multicriteria Decision Making: Concepts, Techniques, and Extensions, Plenum Press, New York, New York, 1985.

    Google Scholar 

  4. Bazaraa, B. S., Goode, J. J., and Nashed, M. Z., On the Cones of Tangents with Applications in Mathematical Programming, Journal of Optimization Theory and Applications, Vol. 13, pp. 389–426, 1974.

    Google Scholar 

  5. Varaiya, P. P., Nonlinear Programming in Banach Space, SIAM Journal on Applied Mathematics, Vol. 15, pp. 284–293, 1967.

    Google Scholar 

  6. Laurent, J. P., Optimization et Approximation, Hermann, Paris, France, 1972.

    Google Scholar 

  7. Kaul, R. N., and Kaur, S., Generalizations of Convex and Related Functions, European Journal of Operational Research, Vol. 9, pp. 369–377, 1982.

    Google Scholar 

  8. Ben-Israel, A., and Mond, B., What is Invexity?, Journal of the Australian Mathematical Society, Vol. 28B, pp. 1–9, 1986.

    Google Scholar 

  9. Weir, T., and Mond, B., Preinvex Functions in Multiple-Objective Optimization, Journal of Mathematical Analysis and Applications, Vol. 136, pp. 29–38, 1988.

    Google Scholar 

  10. Suneja, S. K., and Gupta, S., Duality in Nonlinear Programming Involving Semilocally Convex and Related Functions, Optimization, Vol. 28, pp. 17–29, 1993.

    Google Scholar 

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

    Google Scholar 

  12. Guignard, M., Generalized Kuhn-Tucker Conditions for Mathematical Programming, SIAM Journal on Control, Vol. 7, pp. 232–241, 1969.

    Google Scholar 

  13. Isermann, H., Proper Efficiency and the Linear Vector Maximum Problem, Operations Research, Vol. 22, pp. 189–191, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Bucharest, Romania

    V. Preda (Professor)

  2. Faculty of Mathematics, University of Bucharest, Bucharest, Romania

    I. Chiţescu (Associate Professor)

Authors
  1. V. Preda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Chiţescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Preda, V., Chiţescu, I. On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case. Journal of Optimization Theory and Applications 100, 417–433 (1999). https://doi.org/10.1023/A:1021794505701

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021794505701

Search

Navigation