An extension of the simplex algorithm for semi-infinite linear programming

DOI10.1007/BF01587092zbMath0682.90058MaRDI QIDQ1824547

Edward J. Anderson, Adrian S. Lewis

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

primal methodextreme pointssimplex algorithmsemi-infinite linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (23)

Separating the solution sets of analytical and polynomial systems ⋮ New descent rules for solving the linear semi-infinite programming problem ⋮ Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ Bounding duality gap for separable problems with linear constraints ⋮ Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Locally polyhedral linear inequality systems ⋮ A ladder method for linear semi-infinite programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Inverse optimization in semi-infinite linear programs ⋮ An optimality test for semi-infinite linear programming ⋮ Representability of convex sets by analytical linear inequality systems. ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ Analytical linear inequality systems and optimization ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Quasipolyhedral sets in linear semiinfinite inequality systems ⋮ A purification algorithm for semi-infinite programming ⋮ On linear inequality systems with smooth coefficients ⋮ Selected applications of linear semi-infinite systems theory ⋮ A multi-local optimization algorithm ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Continuous linear complementarity problem

Cites Work

• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Infinite programming. Proceedings of an International Symposium on Infinite Dimensional Linear Programming, Churchill College, Cambridge, United Kingdom, September 7-10, 1984
• Semi-infinite programming. Proceedings of a workshop Bad Honnef August 30 - September 1, 1978
• A projected lagrangian algorithm for semi-infinite programming
• Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
• Numerical treatment of a class of semi‐infinite programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of the simplex algorithm for semi-infinite linear programming