Parallel solution of large-scale, block-angular linear programs
- 116 Downloads
Many important large-scale optimization problems can be formulated as linear programs with a block-angular structure. This structure lends itself naturally to parallel solutions and is used to great advantage in the solution method described. To demonstrate the efficiency of the method, it has been implemented and computationally tested on both a shared-memory vector multiprocessor (CRAY-2) and a local-memory hypercube (NCUBE/seven) with 64 processors. Computational results for problems with as many as 24,000 rows and 74,000 columns (1,024 blocks and 1.4 million nonzero elements) are presented. A problem of this size was solved on the NCUBE in less than four minutes and the CRAY-2 in 37 seconds.
KeywordsComputational Result Solution Method Nonzero Element Parallel Solution Vector Multiprocessor
Unable to display preview. Download preview PDF.
- W.J. Carolan et al., An empirical evaluation of the KORBX algorithms for military airlift applications, Technical Report 89-OR-86, CINCMAC Analysis Group, Scott AFB, Illinois (1989).Google Scholar
- J. Ho and E. Loute, Computational experience with advanced implementation of decomposition algorithms for linear programming, Math. Progr. 27(1983)283–290.Google Scholar
- L.S. Lasdon,Optimization Theory for Large Systems (Macmillan, London, 1970).Google Scholar
- R.S. Maier, Parallel solution of large-scale structured optimization problems, Ph.D. Dissertation, University of Minnesota (1989).Google Scholar
- D. Medhi, Parallel bundle-based decomposition for large-scale structured mathematical programming problems, Ann. Oper. Res., this volume.Google Scholar
- K. Murty,Linear Programming (Wiley, New York, 1983).Google Scholar
- R.J.-B. Wets,Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988).Google Scholar