Complete characterizations of robust strong duality for robust vector optimization problems
type: Item
instance of: scholarly article
title: Complete characterizations of robust strong duality for robust vector optimization problems
zbMATH Open document ID: 1391.90473
author: Y. Aharonov
published in: Vietnam Journal of Mathematics
publication date: 2018-06-13T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6887998
zbMATH Keywords: robust vector optimization
zbMATH Keywords: robust convex optimization
zbMATH Keywords: vector optimization
zbMATH Keywords: robust strong duality
zbMATH Keywords: vector farkas lemma
MaRDI profile type: Publication
full work available at URL: s10013-018-0283-1
OpenAlex ID: W2791753995
cites work: Q3748810
cites work: Q5144461
cites work: Duality in robust optimization: Primal worst equals dual best
cites work: Q3182207
cites work: Theory and Applications of Robust Optimization
cites work: Q4495118
cites work: Vector variational principles; \(\varepsilon\)-efficiency and scalar stationarity
cites work: Conjugate duality in convex optimization
cites work: Duality for vector optimization problems via a general scalarization
cites work: Robust duality in parametric convex optimization
cites work: Duality in Vector Optimization
cites work: Robust linear semi-infinite programming duality under uncertainty
cites work: Farkas-type results for vector-valued functions with applications
cites work: Robust optimization revisited via robust vector Farkas lemmas
cites work: A unifying approach to robust convex infinite optimization duality
cites work: A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
cites work: Q3186421
cites work: Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
cites work: Vector Optimization and Monotone Operators via Convex Duality
cites work: Recent advances in robust optimization: an overview
cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
cites work: Q4367585
cites work: Some robust convex programs without a duality gap
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: Set-valued Optimization
cites work: Q4703393
cites work: A new approach to duality in vector optimization
cites work: Conjugate duality in vector optimization
Wikidata QID: Q130095854
DOI: 10.1007/S10013-018-0283-1
Recommended article: Strong Duality in Robust Convex Programming: Complete Characterizations
Recommended article: Strong and total Fenchel dualities for robust convex optimization problems
Recommended article: Robust duality for robust efficient solutions in uncertain vector optimization problems
Recommended article: Strong duality in parametric robust semi-definite linear programming and exact relaxations
Recommended article: Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization
Recommended article: Characterization of norm-based robust solutions in vector optimization
Recommended article: Robust duality in parametric convex optimization
Recommended article: Robust duality for generalized invex programming problems
Recommended article: Q3180624
Recommended article: Robust optimization revisited via robust vector Farkas lemmas
description: scientific article; zbMATH DE number 6887998