Journal of Applied Analysis 11 (2005), No. 1, 019--033
Copyright Heldermann Verlag 2005
Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
Izhar Ahmad
Department of Mathematics, Aligarh Muslim University, Aligarh 202 002, India
iahmad@postmark.net
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.
Keywords: Multiobjective programming, sufficiency, duality, generalized convexity.
MSC: 90C29, 90C30, 90C46
[ Fulltext-pdf (192 KB)] for subscribers only.