Complete characterizations of robust strong duality for robust vector optimization problems

DOI10.1007/s10013-018-0283-1zbMath1391.90473OpenAlexW2791753995MaRDI QIDQ1639956

Y. Aharonov

Publication date: 13 June 2018

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-018-0283-1

zbMATH Keywords

vector optimizationrobust convex optimizationrobust vector optimizationrobust strong dualityvector farkas lemma

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15)

Related Items (11)

Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Robust duality for nonconvex uncertain vector optimization via a general scalarization ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Scalarization of multiobjective robust optimization problems ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ A new approach to strong duality for composite vector optimization problems

Cites Work

• Robust linear semi-infinite programming duality under uncertainty
• Robust duality in parametric convex optimization
• Duality in robust optimization: Primal worst equals dual best
• Conjugate duality in convex optimization
• Conjugate duality in vector optimization
• A unifying approach to robust convex infinite optimization duality
• Recent advances in robust optimization: an overview
• Farkas-type results for vector-valued functions with applications
• Vector Optimization and Monotone Operators via Convex Duality
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Duality for vector optimization problems via a general scalarization
• Theory and Applications of Robust Optimization
• Duality in Vector Optimization
• A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
• Robust optimization revisited via robust vector Farkas lemmas
• Set-valued Optimization
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
• A new approach to duality in vector optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete characterizations of robust strong duality for robust vector optimization problems