A purification algorithm for semi-infinite programming

DOI10.1016/0377-2217(92)90353-BMaRDI QIDQ1197680zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

gradient methodssemi-infinite linear programmingpurification algorithmrecession conditions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 866106
• An extension of the simplex algorithm for semi-infinite linear programming
• A one-phase algorithm for semi-infinite linear programming
• scientific article; zbMATH DE number 3939126
• New purification algorithms for linear programming

Cites work

• scientific article; zbMATH DE number 3939126 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3677558 (Why is no real title available?)
• scientific article; zbMATH DE number 3528040 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A duality theorem for semi-infinite convex programs and their finite subprograms
• A projected lagrangian algorithm for semi-infinite programming
• An Infinite Linear Program with a Duality Gap
• An extension of the simplex algorithm for semi-infinite linear programming
• Duality gaps in semi-infinite linear programming—an approximation problem
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• Geometric fundamentals of the simplex method in semi-infinite programming
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• The limiting Lagrangian as a consequence of Helly's theorem

Cited in

(11)

• Analytical linear inequality systems and optimization
• New purification algorithms for linear programming
• Representability of convex sets by analytical linear inequality systems.
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• An extension of the simplex algorithm for semi-infinite linear programming
• On linear inequality systems with smooth coefficients
• An accelerated central cutting plane algorithm for linear semi-infinite programming
• New descent rules for solving the linear semi-infinite programming problem
• scientific article; zbMATH DE number 1275849 (Why is no real title available?)
• On the numerical treatment of linearly constrained semi-infinite optimization problems
• An optimality test for semi-infinite linear programming

Describes a project that uses

Uses Software

• XMP

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)