Computer
Decomposition of linear programs using parallel computation
Mathematical Programming: Series A and B
Parallel solution of large-scale, block-angular linear
Annals of Operations Research
Vector processing in simplex and interior methods for linear programming
Annals of Operations Research
Parallel bundle-based decomposition for large-scale structured mathematical programming problems
Annals of Operations Research
Load balancing in the parallel optimization of block-angular linear programs
Mathematical Programming: Series A and B
On the efficacy of distributed simplex algorithms for linear programming
Computational Optimization and Applications - Special issue dedicated to George Dantzig
The parallel decomposition of linear programs
The parallel decomposition of linear programs
Alternative model representations and computing capacity: implications for model management
Decision Support Systems
Quantified linear programs: a computational study
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
This article considers the application of a primal nested-decomposition method to solve staircase linear programs (SLPs) on distributed-memory, multiple-instruction-multiple-data computers. Due to the coupling that exists among the stages of an SLP, a standard parallel-decompositon algorithm for these problems would allow only a subset of the subproblem processes to overlap with one another at any give time. We propose algorithms that seek to increase the amount of overlap among the processes as well as utilize idle time beneficially. Computational results testing the effectiveness of our algoritms are reported, using a standard set of test problems.