Efficient parallel linear programming
Publication
, Journal Article
Pan, V; Reif, J
Published in: Operations Research Letters
January 1, 1986
Linear programming and least squares computations are accelerated using author's parallel algorithms for solving linear systems. The implications on the performance of the Karmarkar and the simplex algorithms for dense and sparse linear programs are examined. The results have further applications to combinatorial algorithms. © 1986.
Duke Scholars
Published In
Operations Research Letters
DOI
ISSN
0167-6377
Publication Date
January 1, 1986
Volume
5
Issue
3
Start / End Page
127 / 135
Related Subject Headings
- Operations Research
- 4901 Applied mathematics
- 1503 Business and Management
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Pan, V., & Reif, J. (1986). Efficient parallel linear programming. Operations Research Letters, 5(3), 127–135. https://doi.org/10.1016/0167-6377(86)90085-4
Pan, V., and J. Reif. “Efficient parallel linear programming.” Operations Research Letters 5, no. 3 (January 1, 1986): 127–35. https://doi.org/10.1016/0167-6377(86)90085-4.
Pan V, Reif J. Efficient parallel linear programming. Operations Research Letters. 1986 Jan 1;5(3):127–35.
Pan, V., and J. Reif. “Efficient parallel linear programming.” Operations Research Letters, vol. 5, no. 3, Jan. 1986, pp. 127–35. Scopus, doi:10.1016/0167-6377(86)90085-4.
Pan V, Reif J. Efficient parallel linear programming. Operations Research Letters. 1986 Jan 1;5(3):127–135.
Published In
Operations Research Letters
DOI
ISSN
0167-6377
Publication Date
January 1, 1986
Volume
5
Issue
3
Start / End Page
127 / 135
Related Subject Headings
- Operations Research
- 4901 Applied mathematics
- 1503 Business and Management
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics