Startseite Efficiency and Duality for Generalized Convex Multiobjective Programming
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Efficiency and Duality for Generalized Convex Multiobjective Programming

  • Z.-X. Yan
Veröffentlicht/Copyright: 9. Juni 2010

Abstract

Under a class of generalized (Type I, F, ρ)-convexity assumptions, the author formulates the sufficient conditions about Pareto efficiency and Geoffrion proper efficiency and gets the dual results between multiobjective programming and its Wolfe dual.

Received: 2006-05-08
Revised: 2007-04-18
Published Online: 2010-06-09
Published in Print: 2008-June

© Heldermann Verlag

Heruntergeladen am 21.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/JAA.2008.63/html
Button zum nach oben scrollen