论文信息 - Second order mixed type duality in multiobjective programming problems

Second order mixed type duality in multiobjective programming problems

Abstract Second order mixed type dual is introduced for multiobjective programming problems. Results about weak duality, strong duality, and strict converse duality are established under generalized second order (F,ρ)-convexity assumptions. These results generalize the duality results recently given by Aghezzaf and Hachimi involving generalized first order (F,ρ)-convexity conditions.

Brahim Aghezzaf

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

[2] Brahim Aghezzaf,et al. Generalized Invexity and Duality in Multiobjective Programming Problems , 2000, J. Glob. Optim..

[3] Zengkun Xu,et al. Mixed Type Duality in Multiobjective Programming Problems , 1996 .

[4] Vaithilingam Jeyakumar,et al. On generalised convex mathematical programming , 1992, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

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

[6] Olvi L. Mangasarian,et al. Second- and higher-order duality in nonlinear programming☆ , 1975 .

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

[8] B. Aghezzaf,et al. SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY , 2001 .

[9] Brahim Aghezzaf,et al. Sufficiency and Duality in Multiobjective Programming Involving Generalized (F, ρ)-Convexity , 2001 .

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

[11] T. Weir,et al. Generalised convexity and duality in multiple objective programming , 1989, Bulletin of the Australian Mathematical Society.