ASYNPLEX, an asynchronous parallel revised simplex algorithm

Annals of Operations Research

Volumn 81, Issue , 1998, Pages 27-49

  Hall, J A J ^a   McKinnon, K I M ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Cray T3D; Linear programming; Parallelism; Revised simplex method

Indexed keywords

EID: 0041728494     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. R.E. Bixby and A. Martin, Parallelizing the dual simplex method, Technical Report SC-95-45, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1995.
2. G.B. Dantzig and W. Orchard-Hays, The product form for the inverse in the simplex method, Math. Comp. 8(1954)64-67.
3. J. Eckstein, I. Boduroglu, L. Polymenakos and D. Goldfarb, Data-parallel implementations of dense simplex methods on the Connection Machine CM-2, ORSA Journal on Computing 7(1995) 402-416.
4. J.J.H. Forrest and J.A. Tomlin, Vector processing in the simplex and interior methods for linear programming, Annals of Operations Research 22(1990)71-100.
5. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter 13(1985)10-12.
6. P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, Sparse matrix methods in optimization, SIAM J. Sci. Stat. Comput. 5(1984)562-589.
7. P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linear and nonlinear programming, Technical Report SOL 88-4, Systems Optimization Laboratory, Stanford University, 1990.
8. D. Goldfarb and J. K. Reid, A practical steepest-edge simplex algorithm, Mathematical Programming 12(1977)361-371.
9. J.A.J. Hall and K.I.M. McKinnon, Update procedures for the parallel revised simplex method, Technical Report MSR 92-13, Department of Mathematics and Statistics, University of Edinburgh, 1992.
10. J.A.J. Hall and K.I.M. McKinnon, PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing, in: Applied Parallel Computing, eds. J. Waśniewski, J. Dongarra, K. Madsen and D. Olesen, Lecture Notes in Computer Science, vol. 1184, Springer, 1996, pp. 67-76.
11. P.M.J. Harris, Pivot selection methods of the Devex LP code, Mathematical Programming 5(1973) 1-28.
12. J.K. Ho and R.P. Sundarraj, On the efficacy of distributed simplex algorithms for linear programming, Computational Optimization and Applications 3(1994)349-363.
13. IBM, Optimization Subroutine Library, Guide and Reference, Release 2, 1993.
14. J. Luo, A.N.M. Hulsbosch and G.L. Reijns, An MIMD work-station for large LP problems, in: Parallel Processing and Applications, eds. E. Chiricozzi and A. D'Amico, Elsevier Science/North-Holland, 1988, pp. 159-169.
15. C.E. Pfefferkorn and J.A. Tomlin, Design of a linear programming system for the ILLIAC IV, Technical Report SOL 76-8, Systems Optimization Laboratory, Stanford University, 1976.
16. W. Shu and M. Wu, Sparse implementation of revised simplex algorithms on parallel computers, in: Proceedings of 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993, pp. 501-509.
17. C.B. Stunkel, Linear optimization via message-based parallel processing, in: International Conference on Parallel Processing, vol. 3, August 1988, pp. 264-271.
18. R. Wunderling, Paralleler und objektorientierter Simplex, Technical Report TR-96-09, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1996.