Parallelizing the Dual Simplex Method

References

• Bauer B.E.Practical Parallel Programming (1992) (Academic Press, New York) Google Scholar
• Barr R.S., Hickman B.L. Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup. Operations Research (1994) 42:65–80Link, Google Scholar
• Bixby R.E., Gregory J.W., Lustig I.J., Marsten R.E., Shanno D.F. Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Operations Research (1992) 40:885–897Link, Google Scholar
• Chvatal V.Linear Programming (1983) (W.H. Freeman and Company, New York) Google Scholar
• Chang M.D., Engquist M., Finkel R., Meyer R.R. A Parallel Algorithm for Generalized Networks. Annals of Operations Research (1988) 14:125–145Crossref, Google Scholar
• Davis T.A., Yew P. A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization. SIAM Journal on Matrix Analysis and Application (1990) 11:383–402Crossref, Google Scholar
• Duff I.S., Erisman A.M., Reid J.K.Direct Methods for Sparse Matrices (1986) (Oxford University Press, London) Google Scholar
• Eckstein J., Boduroglu I.I., Polymenakos L.C., Goldfarb D. Data-Parallel Implementation of Dense Simplex Methods on the Connection Machine CM-2M. ORSA Journal on Computing (1995) 7:402–416Link, Google Scholar
• Forrest J.J., Goldfarb D. Steepest-Edge Simplex Algorithms for Linear Programming. Mathematical Programming (1992) 57:341–374Crossref, Google Scholar
• Forrest J.J.H., Tomlin J.A. Updating Triangular Factors of the Basis to Maintain Sparsity in the Product-Form Simplex Method. Mathematical Programming (1972) 2:263–278Crossref, Google Scholar
• Gill P.E., Murray W., Saunders M.A., Wright M.H. A Practical Anti-Cycling Procedure for Linearly Constrained Optimization. Mathematical Programming (1989) 45:437–474Crossref, Google Scholar
• Gallivan K.A., Heath M.T., Nrefrefg E., Ortega J.M., Peyton B.W., Plemmons R.J., Romine C.H., Sameh A.H., Voigt R.G. Parallel Algorithms for Matrix Computations. Society for Industrial and Applied Mathematics (1990) (Philadelphia, PA)Google Scholar
• Harris P.M.J. Pivot Selection Methods of the Devex LP Code. Mathematical Programming (1973) 5:1–28Crossref, Google Scholar
• Helgason R.V., Kennington J.L., Zaki H.A.A. Parallelization of the Simplex Method. Annals of Operations Research (1988) 14:17–40Crossref, Google Scholar
• Kumar V., Grama A., Gupta A., Karypis G.Introduction to Parallel Computing (1994) (The Benjamin/Cummings Publishing Company, Redwood City, CA) Google Scholar
• Lustig I.J., Rothberg E. Gigaflops in Linear Programming. Operations Research Letters (1996) 18:157–165Crossref, Google Scholar
• Padberg M.Linear Optimization and Extensions (1995) (Springer Verlag, Berlin)Google Scholar
• Peters J. The Network Simplex Method on a Multiprocessor. Networks (1990) 20:845–859Crossref, Google Scholar
• Beguelin A., Dongarra J., Geist A., Jiang W., Manchek R., Sunderam V.PVM: Parallel Virtual Machine, A Users' Guide and Tutorial for Networked Parallel Computing (1994) (The MIT Press, Cambridge, MA) Google Scholar
• POWER C USER'S GUIDE, SILICON GRAPHICS, INCGoogle Scholar
• Stevens W.R.Unix Network Programming (1990) (PTR Prentice-Hall, Englewood Cliffs, NJ) Crossref, Google Scholar
• Wunderling R. Paralleler und objektorientierter Simplex. Technical Report TR 96-09 (1996) . Konrad-Zuse-Zentrum für Informationstechnik BerlinGoogle Scholar