A parallel algorithm for linear programming problems

MaRDI QIDQ1176914zbMATH OpenFDO

Authors Dzh. A. Babaev, Sahib S. Mardanov

Publication date 25 June 1992

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

artificial basismultiprocessor system

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05)

Review text

A multiprocessor system with a central program of calculation in the control processor is described, where all parallel processors in action are realizing the same command simultaneously. Relying on such a special decomposition the simplex method with an artificial basis is suggested for the solution of a linear program.

Recommendations

• scientific article; zbMATH DE number 3883943
• A parallel integer linear programming algorithm
• An optimal parallel algorithm for linear programming in the plane
• Efficient parallel linear programming
• Parallel algorithms for nonlinear programming problems
• A parallel algorithm for multiple objective linear programs
• Decomposition of linear programs using parallel computation
• A new algorithm for parallel solution of linear equations
• Parallel algorithms for solving large linear systems
• Parallel algorithm for solving linear programming problem under conditions of incomplete data

Cited in

(19)

• Decomposition of linear programs using parallel computation
• A review of parallel methods for solving sets of linear equations and their application within optimization algorithms
• SIMPAR: A parallel sparse simplex
• Using massively parallel computations for absolutely precise solution of the linear programming problems
• Efficient algorithm for linear problems using packed data structure with a set of parallel pointers
• scientific article; zbMATH DE number 4176823 (Why is no real title available?)
• scientific article; zbMATH DE number 3883943 (Why is no real title available?)
• scientific article; zbMATH DE number 3843061 (Why is no real title available?)
• On the application of parallel architectures to a class of operations research problems
• Advances in the parallelization of the simplex method
• scientific article; zbMATH DE number 4170050 (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 4053344 (Why is no real title available?)
• scientific article; zbMATH DE number 4068606 (Why is no real title available?)
• scientific article; zbMATH DE number 871908 (Why is no real title available?)
• The parallel simplex-method achievements for errorless solving of linear programming problems
• Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition
• Parallel algorithm for solving linear programming problem under conditions of incomplete data
• Vector processing in simplex and interior methods for linear programming

This page was built for publication: A parallel algorithm for linear programming problems

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