Generalization of Fenchel's duality theorem for convex vector optimization

DOI10.1016/0377-2217(78)90008-5zbMath0424.90068OpenAlexW1975220617MaRDI QIDQ1135212

Christian Gros

Publication date: 1978

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90008-5

zbMATH Keywords

dualityconvex vector optimizationconvex multiple objective optimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (9)

Duality in vector optimization ⋮ On supremum of a set in a multidimensional space ⋮ Lexicographical order and duality in multiobjective programming ⋮ Duality for nonlinear multiple-criteria optimization problems ⋮ Duality and reciprocity for vector programming ⋮ Duality for set-valued multiobjective optimization problems. I: Mathematical programming ⋮ Unnamed Item ⋮ The geometric vector inequality and its properties ⋮ The geometric vector inequality and its properties

Cites Work

• Linear multiobjective programming
• A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
• Constrained minimization under vector-valued criteria in finite dimensional spaces
• Proper efficiency and the theory of vector maximization
• Some duality theorems for the non-linear vector maximum problem
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Problems and methods with multiple objective functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization of Fenchel's duality theorem for convex vector optimization