Parallelizing the dual revised simplex method

This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. T...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 10; no. 1; pp. 119 - 142
Main Authors:	Huangfu, Q., Hall, J. A. J.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2018 Springer Nature B.V
Subjects:	Computation Full Length Paper Iterative methods Linear programming Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Parallel processing Simplex method Solvers Theory of Computation 90C06 Linear programming Parallel computing Revised simplex method 65K05 90C05
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!