ASYNPLEX, an asynchronous parallelrevised simplex algorithm

J. Hall and K. McKinnon

Annals of Operations Research, 1998, vol. 81, issue 0, 27-50

Abstract: This paper describes ASYNPLEX, an asynchronous variant of the revised simplex methodwhich is suitable for parallel implementation on a shared memory multiprocessor or MIMDcomputer with fast inter-processor communication. The method overlaps simplex iterationson different processors. Candidates to enter the basis are tentatively selected using reducedcosts which may be out of date. Later, the up-to-date reduced costs of the tentative candidatesare calculated and candidates are either discarded or accepted to enter the basis. The implementationof this algorithm on a Cray T3D is described and results demonstrating significantspeed-up are presented. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018957107705 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:27-50:10.1023/a:1018957107705

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018957107705

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().