A one-phase algorithm for semi-infinite linear programming
DOI10.1007/BF01585730zbMath0696.90034OpenAlexW2089998287MaRDI QIDQ911454
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585730
Convergenceduality theoremsemi-infinite linear programmingnonlinear semi-infinite programminggeneralized linear programming\(\epsilon \) -optimal solutionsuccession of cuts
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05) Semi-infinite programming (90C34) Duality theory (optimization) (49N15) Methods of successive quadratic programming type (90C55)
Related Items (10)
Cites Work
- A duality theorem for semi-infinite convex programs and their finite subprograms
- A projected lagrangian algorithm for semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- An exact penalty function for semi-infinite programming
- A Nonlinear Programming Problem in Statistics (Educational Testing)
- Numerical treatment of a class of semi‐infinite programming problems
- An Infinite Linear Program with a Duality Gap
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- State Constraints in Convex Control Problems of Bolza
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A one-phase algorithm for semi-infinite linear programming