A purification algorithm for semi-infinite programming

DOI10.1016/0377-2217(92)90353-BzbMath0768.90072OpenAlexW1987937643MaRDI QIDQ1197680

Enriqueta Vercher, Teresa Leon

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

zbMATH Keywords

gradient methodssemi-infinite linear programmingpurification algorithmrecession conditions

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

New descent rules for solving the linear semi-infinite programming problem ⋮ An optimality test for semi-infinite linear programming ⋮ Representability of convex sets by analytical linear inequality systems. ⋮ Analytical linear inequality systems and optimization ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ An accelerated central cutting plane algorithm for linear semi-infinite programming ⋮ On linear inequality systems with smooth coefficients

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Geometric fundamentals of the simplex method in semi-infinite programming
• The limiting Lagrangian as a consequence of Helly's theorem
• An extension of the simplex algorithm for semi-infinite linear programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• A duality theorem for semi-infinite convex programs and their finite subprograms
• A projected lagrangian algorithm for semi-infinite programming
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Duality gaps in semi-infinite linear programming—an approximation problem
• An Infinite Linear Program with a Duality Gap

This page was built for publication: A purification algorithm for semi-infinite programming