Characterizing robust set containments and solutions of uncertain linear programs without qualifications
From MaRDI portal
Publication:974991
DOI10.1016/j.orl.2009.12.004zbMath1220.90067OpenAlexW1977558040WikidataQ59241552 ScholiaQ59241552MaRDI QIDQ974991
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 8 June 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.12.004
Related Items
On approximate efficiency for nonsmooth robust vector optimization problems ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ An exact formula for radius of robust feasibility of uncertain linear programs ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ New strong duality results for convex programs with separable constraints ⋮ Characterizing robust local error bounds for linear inequality systems under data uncertainty ⋮ Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ Robust global error bounds for uncertain linear inequality systems with applications ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Robust duality for generalized convex programming problems under data uncertainty ⋮ Robust duality for fractional programming problems with constraint-wise data uncertainty ⋮ Duality theorems for convex and quasiconvex set functions ⋮ On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems ⋮ Robust duality in parametric convex optimization ⋮ Robust fuzzy structural safety assessment using mathematical programming approach ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Strong duality in robust semi-definite linear programming under data uncertainty ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty ⋮ Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints ⋮ Robust assessment of collapse resistance of structures under uncertain loads based on info-gap model ⋮ Global optimality condition for quadratic optimization problems under data uncertainty ⋮ On robust duality for fractional programming with uncertainty data ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function ⋮ Support vector machine classifiers with uncertain knowledge sets via robust optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Strong duality for robust minimax fractional programming problems ⋮ Surrogate duality for robust optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear optimization under general norms.
- Farkas' lemma for separable sublinear inequalities without qualifications
- Scenario optimization
- On the stable containment of two sets
- Some convex programs without a duality gap
- Duality in robust optimization: Primal worst equals dual best
- Robust solutions of uncertain linear programs
- Set containment characterization
- Robust optimization-methodology and applications
- Nonsmooth vector functions and continuous optimization
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Dual characterizations of set containments with strict convex inequalities
- Robust Convex Optimization
- Knowledge-based semidefinite linear programming classifiers
- Introduction to Stochastic Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
