Set containment characterization
From MaRDI portal
Publication:1810880
DOI10.1023/A:1021207718605zbMath1047.90068OpenAlexW1545324631MaRDI QIDQ1810880
Publication date: 9 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021207718605
Sensitivity, stability, parametric optimization (90C31) Traffic problems in operations research (90B20)
Related Items
Farkas-type results for max-functions and applications ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ The Farkas Lemma revisited ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Correct-By-Construction Exploration and Exploitation for Unknown Linear Systems Using Bilinear Optimization ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces ⋮ Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations ⋮ Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Boolean trends in linear inequalities ⋮ Generalized semi-infinite programming: a tutorial ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ On the stable containment of two sets ⋮ A collision detection approach for maximizing the material utilization ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ How to solve a semi-infinite optimization problem ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Characterizing robust set containments and solutions of uncertain linear programs without qualifications ⋮ Set containment characterization with strict and weak quasiconvex inequalities ⋮ Dual characterizations of set containments with strict convex inequalities ⋮ Vector topical functions and Farkas type theorems with applications ⋮ Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Set containment characterization for quasiconvex programming ⋮ Analyzing linear systems containing strict inequalities via evenly convex hulls ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra
This page was built for publication: Set containment characterization
