Parallelizing the Dual Simplex Method

Bixby RE, Martin A (2000)


Publication Language: English

Publication Type: Journal article

Publication year: 2000

Journal

Publisher: INFORMS (Institute for Operations Research and Management Sciences)

Book Volume: 12

Pages Range: 45 -- 56

Abstract

We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on different parallel platforms, including heterogeneous workstation clusters, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience.

Authors with CRIS profile

How to cite

APA:

Bixby, R.E., & Martin, A. (2000). Parallelizing the Dual Simplex Method. Informs Journal on Computing, 12, 45 -- 56.

MLA:

Bixby, Robert E., and Alexander Martin. "Parallelizing the Dual Simplex Method." Informs Journal on Computing 12 (2000): 45 -- 56.

BibTeX: Download