Home Mathematics Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
Article
Licensed
Unlicensed Requires Authentication

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

  • I. Ahmad
Published/Copyright: June 9, 2010

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.

Key words and phrases.: 90C29; 90C30; 90C46
Received: 2002-11-11
Revised: 2003-08-28
Published Online: 2010-06-09
Published in Print: 2005-June

© Heldermann Verlag

Downloaded on 20.2.2026 from https://www.degruyterbrill.com/document/doi/10.1515/JAA.2005.19/html
Scroll to top button