A degeneracy exploiting LU factorization for the simplex method
From MaRDI portal
Cites work
- A practicable steepest-edge simplex algorithm
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Bipartite graphs and an optimal bordered triangular form of a matrix
- Evolution of linear programming computing techniques
- scientific article; zbMATH DE number 3852781 (Why is no real title available?)
- scientific article; zbMATH DE number 3660725 (Why is no real title available?)
- scientific article; zbMATH DE number 3660726 (Why is no real title available?)
- scientific article; zbMATH DE number 3537147 (Why is no real title available?)
- scientific article; zbMATH DE number 3538745 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- Pivot selection methods of the Devex LP code
- Reinversion with the preassigned pivot procedure
- The elimination form of the inverse and its application to linear programming
Cited in
(4)- On the solution of highly degenerate linear programmes
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- A linear programming decomposition focusing on the span of the nondegenerate columns
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
This page was built for publication: A degeneracy exploiting LU factorization for the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885512)
