Duality for vector optimization problems via a general scalarization
Authors:
- 1 October 2011
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 60 (10-11) , 1269-1290
Abstract
Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the perturbation function are particularized, different dual vector problems are obtained, some of them are already known in the literature. Weak and strong duality statements are delivered in each case.Keywords
This publication has 28 references indexed in Scilit:
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spacesMathematische Nachrichten, 2008
- Duality for location problems with unbounded unit ballsEuropean Journal of Operational Research, 2007
- On Approximate Solutions in Vector Optimization Problems Via ScalarizationComputational Optimization and Applications, 2006
- Degrees of Efficiency and Degrees of MinimalitySIAM Journal on Control and Optimization, 2003
- Generalized Goal Programming: polynomial methods and applicationsMathematical Programming, 2002
- A Multiobjective Diet Planning Support System Using the Satisficing Trade-off MethodJournal of Multi-Criteria Decision Analysis, 1997
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimizationOR Spectrum, 1994
- A Characterization of Proper Minimal Points as Solutions of Sublinear Optimization ProblemsJournal of Mathematical Analysis and Applications, 1993
- Optimality Conditions via Norm Scalarization in Vector OptimizationSIAM Journal on Control and Optimization, 1993
- Basic properties of scalarizmg functionals for multiobjective optimizationMathematische Operationsforschung und Statistik. Series Optimization, 1977