Computational results of an interior point algorithm for large scale linear programming

This paper gives computational results for an efficient implementation of a variant of dual projective algorithm for linear programming. The implementation uses the preconditioned conjugate gradient method for computing projections. Our computational experience reported in this paper indicates that this algorithm has potential as an alternative for solving very large LPs in which the direct methods fail due to memory and CPU time requirements. The conjugate gradient algorithm was able to find very accurate directions even when the system was ill-conditioned. The paper also discusses a new mathematical technique called the reciprocal estimates for estimating the primal variables. We have conducted extensive computational experiments on problems representative of large classes of applications of current interest. We have also chosen instances of the problems of future potential interest, which could not be solved in the past due to the weakness of the prior solution methods, but which represent a large class of new applications. The hypergraph model is such an example. Comparison of our implementation with MINOS 5.1 shows that our implementation is orders of magnitude faster than MINOS 5.1 for these problems.

[1]  G. Reinelt,et al.  Optimal triangulation of large real world input-output matrices , 1983 .

[2]  Mauricio G. C. Resende,et al.  An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..

[3]  Anthony Wren,et al.  Computer-Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, July 28-31, 1987 , 1988 .

[4]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[5]  A. I. Perov,et al.  On the convergence of an iterative process , 1977 .

[6]  Thomas Kailath,et al.  Linear Systems , 1980 .

[7]  Sanjay Mehrotra,et al.  A relaxed version of Karmarkar's method , 1988, Math. Program..

[8]  Clyde L. Monma,et al.  Computational experience with a dual affine variant of Karmarkar's method for linear programming , 1987 .

[9]  Irvin Lustig,et al.  An analysis of an available set of linear programming test problems , 1989, Comput. Oper. Res..

[10]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[13]  Mauricio G. C. Resende,et al.  Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm , 1989, INFORMS J. Comput..

[14]  Gene H. Golub,et al.  Matrix computations , 1983 .

[15]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[16]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[17]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[18]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[19]  Gerhard Reinelt,et al.  On the acyclic subgraph polytope , 1985, Math. Program..

[20]  Fred W. Glover,et al.  Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[21]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[22]  Sanjay Mehrotra,et al.  Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value , 1988, Math. Program..

[23]  F. B. Hildebrand Introduction to Numerical Analysis , 1976 .

[24]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[25]  Kathryn Turner,et al.  A variable-metric variant of the Karmarkar algorithm for linear programming , 1987, Math. Program..

[26]  Martin Desrochers,et al.  Computer-Aided Transit Scheduling , 1992 .

[27]  Robert J. Vanderbei,et al.  The AT&T KORBX® system , 1989, AT&T Technical Journal.