Optimality theory for semi-infinite linear programming∗
From MaRDI portal
Publication:4845183
DOI10.1080/01630569508816638zbMath0838.90122OpenAlexW2004187507MaRDI QIDQ4845183
Marco A. López, Miguel Angel Goberna
Publication date: 4 September 1995
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569508816638
Related Items
Stability of the intersection of solution sets of semi-infinite systems ⋮ Analytical linear inequality systems and optimization ⋮ On linear inequality systems with smooth coefficients ⋮ Topological stability of linear semi-infinite inequality systems ⋮ Locally Farkas-Minkowski linear inequality systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability of best rational Chebyshev approximation
- Strong unicity and alternation for linear optimization
- Conditions for the uniqueness of best generalized rational Chebyshev approximation to differentiable and analytic functions
- An extension of strong uniqueness to rational approximation
- A theory of linear inequality systems
- Uniqueness in linear semi-infinite optimization
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
- A refinement of an optimality criterion and its application to parametric programming
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Semi-Infinite Programming: Theory, Methods, and Applications
- Optimality conditions for convex semi-infinite programming problems
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
This page was built for publication: Optimality theory for semi-infinite linear programming∗
