Investigating the sparse simplex algorithm on a distributed memory multiprocessor

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 151-170

  Maros, I ^a   Mitra, G ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS;

SPARSE SIMPLEX METHOD;

PARALLEL PROCESSING SYSTEMS;

EID: 0033892277     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00100-3     Document Type: Article

References (30)

1. Amdahl G.M. Validity of the single processor approach to achieving large scale computing capabilities. AFIPS Conference Proceedings. 20:1967;483-485.
2. Beasley J. Advances in Linear and Integer Programming. 1996;Oxford University Press, Oxford.
3. M. Benichou, Gautier, Hentges, Ribiere, The efficient solution of large-scale linear programming problems, Mathematical Programming (13) (1977) 280-322.
4. R.E. Bixby, A. Martin, Parallelizing the Dual Simplex Method, Konrad Zuse Zentrum, Berlin, Preprint SC-95-45, December 1995.
5. Chen G.H., Ho H.F., Lin H.F., Sheu J.P. Data mapping of linear programming on fixed size hypercubes. Parallel Computing. 13:1990;235-243.
6. Dantzig G.B. Linear Programming and Extensions. 1963;Princeton University Press, Princeton, NJ.
7. E.F.D. Ellison, M. Hajian, R. Levkovitz, I. Maros, G. Mitra, D. Sayers, FortMP Manual, Department of Mathematics and Statistics, Brunel University, London, and Numerical Algorithms Group NAG, Oxford, May 1994, revised for version 1.04 in June 1995.
8. Forrest J.J.H., Tomlin J.A. Updated triangular factors of the basis to maintain sparsity in the product form of the simplex method. Mathematical Programming. 2:1972;263-278.
9. Forrest J.J.H., Tomlin J.A. Vector processing in simplex and interior point methods for linear programming. Annals of Operations Research. 22:1990;71-100.
10. Forrest J.J., Goldfarb D. Steepest edge simplex algorithms for linear programming. Mathematical Programming. 57(3):1992;341-374.
11. Gay D.M. Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter. 13:1985;10-12.
12. Gill P.E., Murray W., Saunders M.A., Wright M.H. A practical anti-cycling procedure for linearly constrained optimization. Mathematical Programming. 45:1989;437-474.
13. J. Terlaky, T. Gondzio, A computational view of interior point methods, in: J. Beasley (Ed), Advances in Linear and Integer Programming, Ch. 3, Oxford University Press, Oxford, 1996, pp. 103-144.
14. H.J. Greenberg, Pivot selection tactics, in: H.J. Greenberg (Ed.), Design and Implementation of Optimization Software , Sijthoff and Nordhoff, Alphen a/d Rijn, 1978, pp. 143-174.
15. J.A.J., Hall, K. McKinnon, An asynchronous parallel revised simplex algorithm, Applied Mathematical Programming and Modelling, in Applied Mathematical Programming and Modeling (APMOD95), I. Maros, G. Mitra, A. Seiomachen (Eds.), Annals of Operations Research, Baltzer, 1998, 27-49.
16. Harris P.M.J. Pivot selection method of the Devex LP code. Mathematical Programming. 5:1973;1-28.
17. Karmarkar N. A new polynomial time algorithm for linear programming. Combinatorica. 4:1984;373-394.
18. Lustig I.J., Marsten R.E., Shanno D.F. Computational experience with a primal-dual interior point method for linear programming. Linear Algebra and its Applications. 152:1991;191-222.
19. Lustig I.J., Rothberg E. Gigaflops in linear programming. Operations Research Letters. 18(4):1996;157-165.
20. I. Maros, A general Phase-I method in linear programming, European Journal of Operational Research (23) (1986) 64-77.
21. I. Maros, A multicriteria decision problem within the simplex method, in: G. Mitra (Ed.), Mathematical Models for Decision Support, NATO ASI Series, Springer, New York, 1988, pp. 263-272.
22. I. Maros, A structure exploiting pricing procedure for network linear programming, RUTCOR Research Report, RRR #18-91, Rutgers University, NJ, May 1991.
23. I. Maros, G. Mitra, Simplex algorithms, in: J. Beasley (Ed.), Advances in Linear and Integer Programming, Ch. 1, Oxford University Press, Oxford, 1996, pp. 1-46.
24. I. Maros, G. Mitra, Strategies for creating advanced bases for large-scale linear programming problems, INFORMS Journal on Computing 10 (2) (Spring 1998) 248-260.
25. G. Mitra, R. Levkovitz, Solution of large scale linear programs: a review of hardware software and algorithmic issues, in: T. Ciriani, R. Leachman (Eds.), Optimisation in Industrial Environments, Wiley, NewYork, 1993, pp. 139-171.
26. Mitra G., Hajian M., Hai I. A distributed processing algorithm for solving integer programs using a cluster of workstations. Parallel Computing. 23:1997;733-753.
27. Orchard-Hays W. Advanced Linear-Programming Computing Techniques. 1968;McGraw-Hill, NewYork.
28. Power C User's Guide, Silicon Graphics, Inc.
29. C.B. Stunkel, D.A., Reed, Hypercube implementation of the simplex algorithm, Proc. Hypercube Concurrent Computers and Applications, 1988.
30. U.H. Suhl, L.M. Suhl, Computing sparse LU factorizations for large-scale linear programming bases, ORSA Journal on Computing 2(4) (Fall 1990) 325-335.