Pivoting for Size and Sparsity in Linear Programming Inversion Routes

DOI10.1093/IMAMAT/10.3.289MaRDI QIDQ5663634zbMATH OpenOpenAlexFDO

Authors

Publication date 1972

Published in IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imamat/10.3.289

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited in

(7)

• Novel update techniques for the revised simplex method
• Hyper-sparsity in the revised simplex method and how to exploit it
• Presolve Reductions in Mixed Integer Programming
• Preconditioning indefinite systems in interior point methods for large scale linear optimisation
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Towards a practical parallelisation of the simplex method

This page was built for publication: Pivoting for Size and Sparsity in Linear Programming Inversion Routes

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