A purification algorithm for semi-infinite programming
- 26 March 1992
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 57 (3) , 412-420
- https://doi.org/10.1016/0377-2217(92)90353-b
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An extension of the simplex algorithm for semi-infinite linear programmingMathematical Programming, 1989
- Geometric fundamentals of the simplex method in semi-infinite programmingOR Spectrum, 1988
- Reduction and Discrete Approximation in Linear Semi-Infinite ProgrammingOptimization, 1987
- A projected lagrangian algorithm for semi-infinite programmingMathematical Programming, 1985
- A duality theorem for semi-infinite convex programs and their finite subprogramsMathematical Programming, 1983
- Duality gaps in semi-infinite linear programming—an approximation problemMathematical Programming, 1981
- The limiting Lagrangian as a consequence of Helly's theoremJournal of Optimization Theory and Applications, 1981
- An Infinite Linear Program with a Duality GapManagement Science, 1965
- EXTREME POINT SOLUTIONS IN MATHEMATICAL PROGRAMMING: AN OPPOSITE SIGN ALGORITHMPublished by Defense Technical Information Center (DTIC) ,1965
- Duality in Semi-Infinite Programs and Some Works of Haar and CarathéodoryManagement Science, 1963