Lexicographical order and duality in multiobjective programming
From MaRDI portal
Publication:1104248
DOI10.1016/0377-2217(88)90178-6zbMath0646.90076OpenAlexW1992158155WikidataQ57836429 ScholiaQ57836429MaRDI QIDQ1104248
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90178-6
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15)
Related Items
On lexicographic vector equilibrium problems, Surrogate duality for vector optimization, Lexicographical order, lexicographical index, and linear operators, Lexicographic geometric programming, Lagrangian duality for multiobjective programming problems in lexicographic order, A minimax theorem for vector-valued functions in lexicographic order, Characterizations of efficient solutions under polyhedrality assumptions, Lexicographical separation in \({\mathbb{R}}^ n\), General models in min-max continuous location: Theory and solution techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Conjugate maps and duality in multiobjective optimization
- Generalization of Fenchel's duality theorem for convex vector optimization
- Duality theory in multiobjective programming
- A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
- Exact quasiconvex conjugation
- Saddle points and duality in multi-objective programming
- Duality in vector optimization
- Duality for Multiple Objective Convex Programs
- Duality and Alternative in Multiobjective Optimization
- On some relations between a dual pair of multiple objective linear programs
- Nonconvex Duality in Multiobjective Optimization
