论文信息 - Generalized Invexity and Duality in Multiobjective Programming Problems

Generalized Invexity and Duality in Multiobjective Programming Problems

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.

Brahim Aghezzaf | Mohamed Hachimi

[1] R. Kaul,et al. Optimality criteria and duality in multiple-objective optimization involving generalized invexity , 1994 .

[2] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[3] M. A. Hanson. On sufficiency of the Kuhn-Tucker conditions , 1981 .

[4] Richard R Egudo,et al. Efficiency and generalized convex duality for multiobjective programs , 1989 .

[5] M. A. Hanson,et al. Necessary and sufficient conditions in constrained optimization , 1987, Math. Program..

[6] T. Weir. A converse duality theorem in multiple objective programming , 1987 .

[7] E. Polak,et al. Constrained minimization under vector-valued criteria in finite dimensional spaces☆ , 1967 .

[8] T. Maeda. Constraint qualifications in multiobjective optimization problems: Differentiable case , 1994 .

[9] I. Maruşciac,et al. On Fritz John type optimality criterion in multi-objective optimization , 1982 .

[10] G. Giorgi,et al. The Notion of Invexity in Vector Optimization: Smooth and Nonsmooth Case , 1998 .