Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Parallelizing the Dual Simplex Method

Please always quote using this URN: urn:nbn:de:0297-zib-2112
  • 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, Sun S20-502, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Robert E. Bixby, Alexander Martin
Document Type:ZIB-Report
Date of first Publication:1996/01/19
Series (Serial Number):ZIB-Report (SC-95-45)
Published in:Appeared in: INFORMS Journal on Computing, 12(1), (2000) 45-56
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.