Parallelizing the Dual Simplex Method

INFORMS Journal on Computing

Volumn 12, Issue 1, 2000, Pages 45-56

  Bixby, Robert E ^a   Martin, Alexander ^b  

^a RICE UNIVERSITY   (United States)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Dual simplex algorithm; Parallelization

Indexed keywords

EID: 0347110999     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.1.45.11902     Document Type: Article

References (22)

1. B.E. BAUER, 1992. Practical Parallel Programming, Academic Press, New York.
2. R.S. BARR and B.L. HICKMAN, 1994. Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup, Operations Research 42, 65-80.
3. R.E. BIXBY, J.W. GREGORY, I.J. LUSTIG, R.E. MARSTEN, and D.F. SHANNO, 1992. Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods, Operations Research 40, 885-897.
4. V. CHVATAL, 1983. Linear Programming, W.H. Freeman and Company, New York.
5. M.D. CHANG, M. ENGQUIST, R. FINKEL, and R.R. MEYER, 1988. A Parallel Algorithm for Generalized Networks, Annals of Operations Research 14, 125-145.
6. T.A. DAVIS and P. YEW, 1990. A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization, SIAM Journal on Matrix Analysis and Application 11, 383-402.
7. I.S. DUFF, A.M. ERISMAN, and J.K. REID, 1986. Direct Methods for Sparse Matrices, Oxford University Press, London.
8. J. ECKSTEIN, I.I. BODUROGLU, L.C. POLYMENAKOS, and D. GOLDFARB, 1995. Data-Parallel Implementation of Dense Simplex Methods on the Connection Machine CM-2, ORSA Journal on Computing 7, 402-416.
9. J.J. FORREST and D. GOLDFARB, 1992. Steepest-Edge Simplex Algorithms for Linear Programming, Mathematical Programming 57, 341-374.
10. J.J.H. FORREST and J.A. TOMLIN, 1972. Updating Triangular Factors of the Basis to Maintain Sparsity in the Product-Form Simplex Method, Mathematical Programming 2, 263-278.
11. P.E. GILL, W. MURRAY, M.A. SAUNDERS, and M.H. WRIGHT, 1989. A Practical Anti-Cycling Procedure for Linearly Constrained Optimization, Mathematical Programming 45, 437-474.
12. K.A. GALLIVAN, M.T. HEATH, E. NG, J.M. ORTEGA, B.W. PEYTON, R.J. PLEMMONS, C.H. ROMINE, A.M. SAMEH, and R.G. VOIGT, 1990. Parallel Algorithms or Matrix Computations, Society for Industrial and Applied Mathematics, Philadelphia, PA.
13. P.M.J. HARRIS, 1973. Pivot Selection Methods of the Devex LP Code, Mathematical Programming 5, 1-28.
14. R.V. HELGASON, J.L. KENNINGTON, and H.A.A. ZAKI, 1988. Parallelization of the Simplex Method, Annals of Operations Research 14, 17-40.
15. V. KUMAR, A. GRAMA, A. GUPTA, and G. KARYPIS, 1994. Introduction to Parallel Computing, The Benjamin/Cummings Publishing Company, Redwood City, CA.
16. I.J. LUSTIG and E. ROTHBERG, 1996. Gigaflops in Linear Programming, Operations Research Letters 18, 157-165.
17. M. PADBERG, 1995. Linear Optimization and Extensions, Springer Verlag, Berlin.
18. J. PETERS, 1990. The Network Simplex Method on a Multiprocessor, Networks 20, 845-859.
19. A. BEGUELIN, J. DONGARRA, A. GEIST, W. JIANG, R. MANCHEK, and V. SUNDERAM, 1994. PVM: Parallel Virtual Machine, A Users' Guide and Tutorial for Networked Parallel Computing, The MIT Press, Cambridge, MA.
20. POWER C USER'S GUIDE, SILICON GRAPHICS, INC.
21. W.R. STEVENS, 1990. Unix Network Programming, PTR Prentice Hall, Englewood Cliffs, NJ.
22. R. WUNDERLING, 1996. Paralleler und objektorientierter Simplex, Technical Report TR 96-09, Konrad-Zuse-Zentrum für Informationstechnik Berlin.