Abstract
We consider the use of distributed computation to solve general unstructured linear programs by the inherently serial approach of the simplex method. Timing models for the distributed algorithms are presented to predict results which are then verified empirically. Our results contribute to the identification of all viable exploitations of distributed computing which is likely to become a prevalent environment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amdahl, G.M., 1967. “The validity of the single-processor approach to achieving large-scale computer capabilities,”AFIPS Conference Proceedings, 30, 483–485.
Dantzig, G.B. and Orchard-Hays, W. 1954. “The product form for the inverse in the simplex method,”Mathematical Tables and Other Aids to Computation, 8, 64–67.
Dantzig, G.B. and Wolfe, P. 1960. “The decomposition principle for linear programs,”Operations Research, 8, 101–111.
De Witt, D., Finkel, R., and Solomon, M. 1987. “The CRYSTAL multicomputer: design and implementation experience,”IEEE Transactions on Software Engineering, SE-13, 953–966.
Flynn, M.J. 1966. “Very high speed computing,”IEEE Proceedings, 54, 1901–1909.
Forrest, J.J.H. and Tomlin, J.A. 1972. “Updating triangular factors of the basis to maintain sparsity in the product form of simplex method,”Mathematical Programming, 2, 263–278.
Forrest, J.J.H. and Tomlin, J.A. 1990. “Vector processing in simplex and interior methods for linear programming,”Annals of Operations Research, 22, 71–100.
Gay, D.M. 1985. “Electronic mail distribution of linear programming test problems,”Mathematical Programming Society COAL Newsletter, December.
Gnanendran, S.K. and Ho, J.K. 1993. “Load balancing in the parallel optimization of large-scale, block-angular linear programs,”Mathematical Programming, 62, 41–67.
Hellerman, E. and Rarick, D. 1971. “Reinversion with the preassigned pivot procedure,”Mathematical Programming, 1, 195–216.
Ho, J.K., Lee, T.C., and Sundarraj, R.P. 1988. “Decomposition of linear programs using parallel computation,”Mathematical Programming, 42, 391–405.
Ho, J.K. and Sundarraj, R.P. 1983. “A timing model for the revised simplex method,”OR Letters, 13, 67–73.
IBM Corporation 1987, “Engineering and scientific subroutine library, guide and reference,” Publication No. CS23-0184-2.
Intel Corporation 1991. “iPSC/860 user's guide,” Order No. 311532-007.
Karp, A. 1987. “Programming for parallelism,”Computer, 20, 43–57.
Medhi, D. 1990. “Parallel bundle-based decomposition for large-scale structured mathematical programming problems,”Annals of Operations Research, 22, 101–127.
Neves, K.W. 1984. “Vectorization of scientific software,” inHigh Speed Computations, Ed. J.S. Kowalik, NATO ASI Series, Computer and Systems Sciences 7, Springer-Verlag, Berlin.
Seitz, C.L. 1985. “The cosmic cube,”Communications of the ACM, 28, 22–33.
Stone, J.C., Koltz, E.S., and Strauss, C.J. 1989. “WHIZARD for vector processors: a progress report,” Working Paper Ketron Management Science Inc. 1700 North Moore, Arlington, VA.
Tomlin, J.A. 1973. “LPM1 user's guide,” Unpublished manuscript, Systems Optimization Laboratory, Stanford University, Stanford, CA.
Author information
Authors and Affiliations
Additional information
Dedicated to Professor George B. Dantzig on the occasion of his eightieth birthday.
Rights and permissions
About this article
Cite this article
Ho, J.K., Sundarraj, R.P. On the efficacy of distributed simplex algorithms for linear programming. Comput Optim Applic 3, 349–363 (1994). https://doi.org/10.1007/BF01299209
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01299209