Skip to main content
Log in

Generalized Invexity and Duality in Multiobjective Programming Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we are concerned with the multiobjective programming problem with inequality constraints. We introduce new classes of generalized type I vector-valued functions. Duality theorems are proved for Mond–Weir and general Mond–Weir type duality under the above generalized type I assumptions.

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

  • Aghezzaf, B. and Hachimi, M. (1998), Sufficient optimality conditions and duality for multiobjective optimization problems, Proceedings of the Second International Conference on Applied Mathematics and Engineerings Sciences, Casablanca, Maroc: 16-22.

  • Da Cunha, N.O. and Polak, E. (1967), Constrained minimization under vector-valued criteria in finite dimensional spaces, Journal of Mathematical Analysis and Applications 19: 103-124.

    Google Scholar 

  • Egudo, R. (1989), Efficiency and generalized convex duality for multiobjective programs, Journal of Mathematical Analysis and Applications 138: 84-94.

    Google Scholar 

  • Giorgi, G. and Guerraggio, A. (1998), The notion of invexity in vector optimization: smooth and nonsmooth case, Proceedings of the Fifth Symphosium on Generalized Convexity, held in Luminy-Marseille (France), June 17–21, 1996, edited by J.-P. Crouzeix, J.-E. Martinez Legaz and M. Volle, Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Dordrecht 27: 389-405.

    Google Scholar 

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

    Google Scholar 

  • Hanson, M.A. and Mond, B. (1987), Necessary and sufficiency conditions in constrained optimization, Mathematical Programming 37: 51-58.

    Google Scholar 

  • Kaul, R.N., Suneja, S.K. and Srivastava, M.K. (1994), Optimality criteria and duality in multipleobjective optimization involving generalized invexity, Journal of Optimization Theory and Applications 80: 465-482.

    Google Scholar 

  • Maeda, T. (1994), Constraint qualification in multiobjective optimization problems: differentiable case, Journal of Optimization Theory and Applications 80: 483-500.

    Google Scholar 

  • Mangasarian, O.L. (1969), Nonlinear programming, McGraw Hill, New York, New York.

    Google Scholar 

  • Marusciac, I. (1982), On Fritz John type optimality criterion in multiobjective optimization, L'Analyse Numérique et la Theorie de l'Approximation 11: 109-114.

    Google Scholar 

  • Mond, B. and Weir, T. (1981), Generalized concavity and duality, in S. Schaible and W. T. Ziemba, (eds.), Generalized Concavity Optimisation and Economics, Academic Press, New York, New York: 263-280.

    Google Scholar 

  • Weir, T. (1987), A converse duality theorem inmultiple objective programming, Operations Research Letters 6: 129-130.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aghezzaf, B., Hachimi, M. Generalized Invexity and Duality in Multiobjective Programming Problems. Journal of Global Optimization 18, 91–101 (2000). https://doi.org/10.1023/A:1008321026317

Download citation

  • Issue Date:

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

Navigation