Permutations in the Factorization of Simplex Bases
From MaRDI portal
Recommendations
Cites work
- A fast LU update for linear programming
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Computational techniques of the simplex method
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3538745 (Why is no real title available?)
- scientific article; zbMATH DE number 3625109 (Why is no real title available?)
- Novel update techniques for the revised simplex method
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Steepest-edge simplex algorithms for linear programming
- The dual simplex method, techniques for a fast and stable implementation
- The simplex method of linear programming using LU decomposition
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(5)
Describes a project that uses
Uses Software
This page was built for publication: Permutations in the Factorization of Simplex Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139619)