A purification algorithm for semi-infinite programming
DOI10.1016/0377-2217(92)90353-BzbMATH Open0768.90072OpenAlexW1987937643MaRDI QIDQ1197680FDOQ1197680
Authors: Teresa León, E. Vercher 
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90353-b
Recommendations
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Duality gaps in semi-infinite linear programming—an approximation problem
- Geometric fundamentals of the simplex method in semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- A projected lagrangian algorithm for semi-infinite programming
- Title not available (Why is that?)
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- An Infinite Linear Program with a Duality Gap
- Title not available (Why is that?)
- A duality theorem for semi-infinite convex programs and their finite subprograms
- The limiting Lagrangian as a consequence of Helly's theorem
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Title not available (Why is that?)
Cited In (11)
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- New purification algorithms for linear programming
- Representability of convex sets by analytical linear inequality systems.
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Analytical linear inequality systems and optimization
- On linear inequality systems with smooth coefficients
- Title not available (Why is that?)
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- An extension of the simplex algorithm for semi-infinite linear programming
- An optimality test for semi-infinite linear programming
- New descent rules for solving the linear semi-infinite programming problem
Uses Software
This page was built for publication: A purification algorithm for semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197680)
