Decomposition of linear programs using parallel computation

DOI10.1007/BF01589413zbMath0658.90064OpenAlexW1989947719MaRDI QIDQ1111935

Tak C. Lee, James K. Ho, Rangaraja P. Sundarraj

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589413

zbMATH Keywords

large-scale systemsDantzig-Wolfe decompositionparallel processingblock-angular linear programsDECOMPAR

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Decomposition methods (49M27)

Related Items

On the efficacy of distributed simplex algorithms for linear programming, Triangularity of the basis in linear programs for material requirements planning, Partitioning mathematical programs for parallel solution, Towards a practical parallelisation of the simplex method, Parallel decomposition of multistage stochastic programming problems, Parallel processors for planning under uncertainty, Load balancing in the parallel optimization of block-angular linear programs

Cites Work

• Triangularity of the basis in linear programs for material requirements planning
• Decomposition Principle for Linear Programs
• Computational aspects of DYNAMICO : a model of trade and development in the world economy
• Recent advances in the decomposition approach to linear programming
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming