Load balancing in the parallel optimization of block-angular linear programs

DOI10.1007/BF01585159zbMath0798.90096MaRDI QIDQ1321661

S. Kingsley Gnanendran, James K. Ho

Publication date: 23 May 1994

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

zbMATH Keywords

decompositionmultiprocessorblock-angular linear programs

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Parallel numerical computation (65Y05)

Related Items

On the efficacy of distributed simplex algorithms for linear programming ⋮ Towards a practical parallelisation of the simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel solution of large-scale, block-angular linear programs
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
• Decomposition of linear programs using parallel computation
• DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
• On the efficacy of distributed simplex algorithms for linear programming
• Decomposition Principle for Linear Programs
• Computational aspects of DYNAMICO : a model of trade and development in the world economy
• Computational experience with advanced implementation of decomposition algorithms for linear programming
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming