SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER

References

• R. H. Bisscling , T. M. Doup , L. D. J, C. Loycns , A parallel interior point algorithm for linear programming on a network of 400 transputers , Annals of Operations Research 43 ( 1993 ).
   Google Scholar
• T. Blank , The MasPar MP-1 architecture , in Proceeding; of IEEE , Compcon Spring 1990 , IEEE , February 1990 .
   Google Scholar
• W. Carolan , J. Hill , J. Kcnnington , S. Niemi and S. Wichmann , An empirical evaluation fo the KORBX algorithms for military airlift applications , Operations Research 38 ( 1990 ), 240 – 248 .
   Web of Science ®Google Scholar
• I. Duff , A. Erisman and J. Reid , Direct Methods for Sparse Matrices , Oxford University Press , 1989 .
   Google Scholar
• J. J. H. Forrest and J. A. Tbmlin , Implementing interior point linear programming methods in the Optimization Subroutine Library , IBM Systems Journal 31 ( 1992 ), 26 – 38 .
   Google Scholar
• A. George and J. W. H. Liu , Computer Solutions of Large Sparse Positive Definite Systems , Prentice-Hall , 1981 .
   Google Scholar
• R. Lcvkovitz , An Investigation of Interior Point Methods for Large Scale Linear Programs Theory and Computational Algorithms , Ph.D. thesis , Brunei , The University of West London , 1992 .
   Google Scholar
• —, Solving large scale linear programming problems using an interior point method on a vector computer , Tech. Report TR/06/93 , Brunei , The University of West London , August 1993 .
   Google Scholar
• R. Lcvkovitz and G. Mitra , Solution of large sparse symmetric equations on a transputer network , in Proceedings of the Third International Conference on Applications of Transputers , IOS Press ( 1991 ) , 105 – 110 .
   Google Scholar
• —, Solution of large-scale linear programs A review of hardware , software and algorithmic issues , in Optimization in Industry , T. A. Ciriani and R. C. Lcachman, eds. , John Wiley & Sons , 1993 , 139 – 171 .
   Google Scholar
• I. J. Lustig , R. E. Marsten , D. F Shanno, Interior point methods Computational state of the art , Technical Report, School of Engineering and Applied Science, Dcpt. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544, USA, December 1992. Also available as RUTCOR Research Report RRR 41-92, RUTCOR , Rutgers University , New Brunswick , NJ , USA . To appear in ORSA Journal on Computing .
   Google Scholar
• F. Manne and H. Hafsteinsson , Efficient sparse Cholcsky factorization on a parallel SIMD computer , Tech. Report CS-93-S4, Department of Informatics , University of Bcrgcn , 1993 .
   Google Scholar
• R. E. Marsten , D. F Shanno, Interior point methods for linear programming Ready for production use, Workshop at the ORSA/TIMS Joint National Meeting in Philadelphia, PA, USA, School of Industrial and System Engineering , Georgia Institute of Technology , Atlanta , GA 30322 , USA , October 1990 .
   Google Scholar
• S. Mchrotra , On the implementation of a primal-dual interior point method , SLAM Journal on Optimization 2 ( 1992 ), 575 – 601 .
   Google Scholar
• M. J. Saltzman , Implementation of an interior point LP algorithm on a shared-memory vector multiprocessor , in Operations Research and Computer Science New Developments in Their Interfaces , O. Balci, R. Sharda and S. A. Zenios, eds. , Pcrgamon Press , Oxford , UK , 1992 .
   Google Scholar
• C. Tbng , S. Grootoonk , H. Byrne , T. Spinks , A. Lammertsma T Jones, Positron emission tomography Recovery of resolution by finite elements method , The Journal of Nuclear Medicine 34 ( 1993 ), 26P–27P.
   Google Scholar
• R. J. Vanderbei , Splitting dense columns in sparse linear systems , Linear Algebra and Its Applications 152 ( 1991 ), 107 – 117 .
   Google Scholar
• ∗This work was performed while the author was visiting the Department of Mathematics and Statistics, Brunei University.
   Google Scholar