Novel update techniques for the revised simplex method
From MaRDI portal
Recommendations
- A fast LU update for linear programming
- scientific article; zbMATH DE number 4059114
- A Block-$LU$ Update for Large-Scale Linear Programming
- On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases
- Hyper-sparsity in the revised simplex method and how to exploit it
Cites work
- scientific article; zbMATH DE number 3554052 (Why is no real title available?)
- A Block-$LU$ Update for Large-Scale Linear Programming
- A fast LU update for linear programming
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A stabilization of the simplex method
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Hyper-sparsity in the revised simplex method and how to exploit it
- Matrix augmentation and partitioning in the updating of the basis inverse
- On pricing and backward transformation in linear programming
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Sparse Matrix Methods in Optimization
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- The Product Form for the Inverse in the Simplex Method
- 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
(16)- The double pivot simplex method
- Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations
- A fast LU update for linear programming
- scientific article; zbMATH DE number 4059114 (Why is no real title available?)
- scientific article; zbMATH DE number 7339436 (Why is no real title available?)
- Stable modification of explicitLU factors for simplex updates
- Parallel search paths for the simplex algorithm
- Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
- On the use of dense matrix techniques within sparse simplex
- Parallelization of the FICO Xpress-Optimizer
- scientific article; zbMATH DE number 176402 (Why is no real title available?)
- A Z-simplex algorithm with partial updates
- An efficient approach to updating simplex multipliers in the simplex algorithm
- Permutations in the Factorization of Simplex Bases
- Parallelizing the dual revised simplex method
- scientific article; zbMATH DE number 3858836 (Why is no real title available?)
This page was built for publication: Novel update techniques for the revised simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352418)
