Parallel solution of large-scale, block-angular linear programs
From MaRDI portal
DOI10.1007/BF02023046zbMATH Open0714.90066MaRDI QIDQ751502FDOQ751502
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Primal partition programming for block diagonal matrices
- Development of Parallel Methods for a $1024$-Processor Hypercube
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
Cited In (16)
- Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems
- Title not available (Why is that?)
- Parallel implementation of a central decomposition method for solving large-scale planning problems
- An Interior Point Method for Block Angular Optimization
- Load balancing in the parallel optimization of block-angular linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
- Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods
- Active set methods for problems in column block angular form
- On the application of parallel architectures to a class of operations research problems
- Title not available (Why is that?)
- Towards a practical parallelisation of the simplex method
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
- Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems
- Parallel Implementation of Lemke's Algorithm on the Hypercube
Uses Software
Recommendations
- An Interior Point Method for Block Angular Optimization 👍 👎
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method 👍 👎
- Large-scale 0-1 linear programming on distributed workstations 👍 👎
- Load balancing in the parallel optimization of block-angular linear programs 👍 👎
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems 👍 👎
This page was built for publication: Parallel solution of large-scale, block-angular linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751502)
