On the efficacy of distributed simplex algorithms for linear programming
From MaRDI portal
Publication:1342885
DOI10.1007/BF01299209zbMath0814.90078MaRDI QIDQ1342885
James K. Ho, Rangaraja P. Sundarraj
Publication date: 15 January 1995
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items (7)
Parallel search paths for the simplex algorithm ⋮ Advances in the Parallelization of the Simplex Method ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Towards a practical parallelisation of the simplex method ⋮ Using massively parallel computations for absolutely precise solution of the linear programming problems ⋮ Peer‐to‐peer distributed text classifier learning in PADMINI ⋮ Load balancing in the parallel optimization of block-angular linear programs
Cites Work
- Vector processing in simplex and interior methods for linear programming
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Decomposition of linear programs using parallel computation
- Load balancing in the parallel optimization of block-angular linear programs
- A timing model for the revised simplex method
- Decomposition Principle for Linear Programs
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Reinversion with the preassigned pivot procedure
- The Product Form for the Inverse in the Simplex Method
This page was built for publication: On the efficacy of distributed simplex algorithms for linear programming
