A parallelization of the simplex method

A parallelization of the simplex method

0.00 Avg rating0 Votes
Article ID: iaor1988736
Country: Switzerland
Volume: 14
Start Page Number: 17
End Page Number: 40
Publication Date: Dec 1988
Journal: Annals of Operations Research
Authors: , ,
Keywords: parallel processing
Abstract:

This paper presents a parallelization of the simplex method for linear programming. Current implementations of the simplex method on sequential computers are based on a triangular factorization of the inverse of the current basis. An alternative decomposition designed for parallel computation, called the quadrant interlocking factorization, has previously been proposed for solving linear systems of equations. This research presents the theoretical justification and algorithms required to implement this factorization in a simplex-based linear programming system.

Reviews

Required fields are marked *. Your email address will not be published.