Pivoting for Size and Sparsity in Linear Programming Inversion Routes
From MaRDI portal
Publication:5663634
DOI10.1093/imamat/10.3.289zbMath0249.90039OpenAlexW1973727312MaRDI QIDQ5663634
No author found.
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
Related Items (7)
Preconditioning indefinite systems in interior point methods for large scale linear optimisation ⋮ Towards a practical parallelisation of the simplex method ⋮ Hyper-sparsity in the revised simplex method and how to exploit it ⋮ The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results ⋮ Presolve Reductions in Mixed Integer Programming ⋮ Novel update techniques for the revised simplex method ⋮ A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
This page was built for publication: Pivoting for Size and Sparsity in Linear Programming Inversion Routes
