Decomposition of linear programs using parallel computation
From MaRDI portal
This paper describes DECOMPAR: an implementation of the Dantzig-Wolfe decomposition algorithm for block-angular linear programs using parallel processing of the subproblems. The software is based on a robust experimental code for LP decomposition and runs on the CRYSTAL multicomputer at the University of Wisconsin-Madison. Initial computational experience is reported. Promising directions in future development of this approach are discussed.
Recommendations
- Publication:4861609
- scientific article; zbMATH DE number 1113880
- scientific article; zbMATH DE number 3883943
- A parallel algorithm for linear programming problems
- scientific article; zbMATH DE number 1372511
- Parallel Decomposition: Results for Staircase Linear Programs
- Efficient parallel linear programming
- A parallel integer linear programming algorithm
- An efficient decomposition method for linear programming problems
- On the parallel use of the decomposition method in a pair of dual problems of linear programming
Cites work
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- Decomposition Principle for Linear Programs
- Recent advances in the decomposition approach to linear programming
- Triangularity of the basis in linear programs for material requirements planning
Cited in
(33)- Triangularity of the basis in linear programs for material requirements planning
- A parallel algorithm for linear programming problems
- DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
- On the parallel use of the decomposition method in a pair of dual problems of linear programming
- Load balancing in the parallel optimization of block-angular linear programs
- Decomposition method application to a large scale linear programming WIP projection model
- On the efficacy of distributed simplex algorithms for linear programming
- Partitioning mathematical programs for parallel solution
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Parallel decomposition of multistage stochastic programming problems
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- Algorithm 928: A general, parallel implementation of Dantzig-Wolfe decomposition
- scientific article; zbMATH DE number 4174661 (Why is no real title available?)
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- Three-level Decomposition Approach for Solving Feedstock Problems on Microcomputers
- Solving Linear Programs Using Multiparty Computation
- scientific article; zbMATH DE number 4027166 (Why is no real title available?)
- Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems
- scientific article; zbMATH DE number 4030824 (Why is no real title available?)
- A Solution-Cascading Approach to the Decomposition of Staircase Linear Programs
- scientific article; zbMATH DE number 1031318 (Why is no real title available?)
- scientific article; zbMATH DE number 1113880 (Why is no real title available?)
- scientific article; zbMATH DE number 1372511 (Why is no real title available?)
- Parallel Decomposition: Results for Staircase Linear Programs
- scientific article; zbMATH DE number 836435 (Why is no real title available?)
- scientific article; zbMATH DE number 871908 (Why is no real title available?)
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Parallel Processing and Applied Mathematics
- Parallel implementation of a central decomposition method for solving large-scale planning problems
- Parallel processors for planning under uncertainty
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Towards a practical parallelisation of the simplex method
This page was built for publication: Decomposition of linear programs using parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111935)
