论文信息 - Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity

Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity

Abstract A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.

I. Ahmad

[1] W. Ziemba,et al. Generalized concavity in optimization and economics , 1981 .

[2] T. R. Gulati,et al. Sufficiency and Duality in Multiobjective Programming Involving Generalized F-Convex Functions , 1994 .

[3] Jean-Philippe Vial,et al. Strong and Weak Convexity of Sets and Functions , 1983, Math. Oper. Res..

[4] D. G. Mahajan,et al. Generalization of some duality theorems in nonlinear programming , 1977, Math. Program..

[5] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[6] M. A. Hanson,et al. Further Generalizations of Convexity in Mathematical Programming , 1982 .

[7] Vasile Preda,et al. On efficiency and duality for multiobjective programs , 1992 .

[8] T. Weir,et al. Proper efficiency and duality for vector valued optimization problems , 1987, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.