The Composite Simplex Algorithm

DOI10.1137/1007004zbMath0133.42703MaRDI QIDQ5343965

Philip Wolfe

Publication date: 1965

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1007004

zbMATH Keywords

operations research

Related Items

A Variant of the Dual Pivoting Rule in Linear Programming, LPAKO: A Simplex-based Linear Programming Program, Solving staircase linear programs by the simplex method, 2: Pricing, A general phase-I method in linear programming, Degeneracy in the presence of roundoff errors, An improved general Phase-I method in linear programming, A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy, A practical anti-cycling procedure for linearly constrained optimization, MOPS -- Mathematical optimization system, Recovering an optimal LP basis from an interior point solution, An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem, Advances in design and implementation of optimization software, Steepest-edge simplex algorithms for linear programming, A generalized dual phase-2 simplex algorithm., Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, A simplex algorithm for piecewise-linear programming I: Derivation and proof, Piecewise-linear programming: The compact (CPLP) algorithm, A step toward probabilistic analysis of simplex method convergence, An example of cycling in a feasible point algorithm, An implementation of the simplex method for linear programming problems with variable upper bounds, An Implementation of Variable Upper Bounds via SUB Methodology, Bottleneck linear programming, On the Bartels—Golub decomposition for linear programming bases