The Composite Simplex Algorithm

Cited in

(25)

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.
A two-phase support method for solving linear programs: numerical experiments
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
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
MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound

This page was built for publication: The Composite Simplex Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343965)