The Composite Simplex Algorithm

DOI10.1137/1007004zbMath0133.42703OpenAlexW2004709509MaRDI 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 simplex algorithm for piecewise-linear programming I: Derivation and proof, Recovering an optimal LP basis from an interior point solution, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, 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, An Implementation of Variable Upper Bounds via SUB Methodology, An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem, Piecewise-linear programming: The compact (CPLP) algorithm, A Variant of the Dual Pivoting Rule in Linear Programming, A two-phase support method for solving linear programs: numerical experiments, Bottleneck linear programming, On the Bartels—Golub decomposition for linear programming bases, A step toward probabilistic analysis of simplex method convergence, Steepest-edge simplex algorithms for linear programming, LPAKO: A Simplex-based Linear Programming Program, A practical anti-cycling procedure for linearly constrained optimization, A generalized dual phase-2 simplex algorithm., An example of cycling in a feasible point algorithm, Solving staircase linear programs by the simplex method, 2: Pricing, An implementation of the simplex method for linear programming problems with variable upper bounds, Advances in design and implementation of optimization software, MOPS -- Mathematical optimization system, A general phase-I method in linear programming