Duality for vector optimization problems via a general scalarization
From MaRDI portal
Publication:3111136
DOI10.1080/02331934.2010.505959zbMath1231.49032OpenAlexW2017722069MaRDI QIDQ3111136
Radu Ioan Boţ, Sorin-Mihai Grad
Publication date: 18 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.505959
Convex programming (90C25) Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15)
Related Items (8)
A Fenchel-Moreau theorem for $\bar L^0$-valued functions ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Optimality and duality in nonsmooth conic vector optimization ⋮ Duality in nonconvex vector optimization ⋮ A new approach to strong duality for composite vector optimization problems
Cites Work
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Nonconvex separation theorems and some applications in vector optimization
- Proper efficiency in vector optimization on real linear spaces.
- On approximate solutions in vector optimization problems via scalarization
- Duality for location problems with unbounded unit balls
- Conjugate duality in convex optimization
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Generalized goal programming: polynomial methods and applications
- Scalarization of Henig proper efficient points in a normed space
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization
- Scalarization and stability in vector optimization
- On scalarizing functions in multiobjective optimization
- A new duality approach to solving concave vector maximization problems
- A general approach for studying duality in multiobjective optimization
- Duality in Vector Optimization
- Scalarization in vector optimization
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A Multiobjective Diet Planning Support System Using the Satisficing Trade-off Method
- Degrees of Efficiency and Degrees of Minimality
- Optimality Conditions via Norm Scalarization in Vector Optimization
- Unnamed Item
This page was built for publication: Duality for vector optimization problems via a general scalarization
