Speeding up the primal simplex algorithm on parallel computer

Authors:
Basile Kamdoum
Affiliations:
University of Yaounde
Venue:
ACM SIGMAP Bulletin
Year:
1982

Citing 3
Cited 0

The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
A Survey of Parallel Machine Organization and Programming

ACM Computing Surveys (CSUR)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This communication considers the problem of implementing the classical primal simplex algorithm on a parallel computer. The simplex algorithm is sequential in nature but computation within each step can be accelerated using k processors; the speeding up is proportional to k.