Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications

DOI10.1016/j.orl.2020.07.004zbMath1485.90081OpenAlexW3040997645MaRDI QIDQ2661520

Yanyan Li

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.07.004

zbMATH Keywords

robust optimizationlower semi-continuous functiondual characterizationset containmentsublinear functionuncertain linear programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Robustness in mathematical programming (90C17)

Cites Work

• Robust linear optimization under general norms.
• Farkas' lemma for separable sublinear inequalities without qualifications
• On the stable containment of two sets
• Some convex programs without a duality gap
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Set containment characterization
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
• Dual characterizations of set containments with strict convex inequalities
• Knowledge-based semidefinite linear programming classifiers
• An Introduction to Banach Space Theory
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• On bases in Banach spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications