On the efficacy of distributed simplex algorithms for linear programming

DOI10.1007/BF01299209MaRDI QIDQ1342885zbMATH OpenFDO

Authors James K. Ho, Rangaraja P. Sundarraj

Publication date 15 January 1995

Published in Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

distributed algorithmsmultiprocessingunstructured linear programs

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Large-scale 0-1 linear programming on distributed workstations
• Efficient parallel linear programming
• scientific article; zbMATH DE number 3883943
• Parallel distributed-memory simplex for large-scale stochastic LP problems
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor

Cites work

• A timing model for the revised simplex method
• Decomposition Principle for Linear Programs
• Decomposition of linear programs using parallel computation
• Load balancing in the parallel optimization of block-angular linear programs
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
• Reinversion with the preassigned pivot procedure
• The Product Form for the Inverse in the Simplex Method
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Vector processing in simplex and interior methods for linear programming

Cited in

(13)

• Advances in the parallelization of the simplex method
• Peer‐to‐peer distributed text classifier learning in PADMINI
• scientific article; zbMATH DE number 4176823 (Why is no real title available?)
• Using massively parallel computations for absolutely precise solution of the linear programming problems
• Load balancing in the parallel optimization of block-angular linear programs
• Input–Output Performance of Linear–Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems
• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
• Parallel search paths for the simplex algorithm
• Towards a practical parallelisation of the simplex method
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• Solving Linear Programs Using Multiparty Computation
• Efficient GPU-based implementations of simplex type algorithms
• Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition

This page was built for publication: On the efficacy of distributed simplex algorithms for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342885)