Solving a class of LP problems with a primal-dual logarithmic barrier method

Applying a higher order primal-dual logarithmic barrier method for solving large real-life linear programming problems is addressed in this paper. The efficiency of an interior point algorithm on these problems is compared with the one of the state-of-the-art simplex code MINOS version 5.3. Based on such experience, a wide class of LP problems is identified for which logarithmic barrier approach seems advantageous over the simplex one. Additionally, some practical rules for model builders are derived that should allow them to create problems that can easily be solved with logarithmic barrier algorithms.

[1]  John A. Tomlin,et al.  Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library , 1992, IBM Syst. J..

[2]  Thomas W. Hertel,et al.  Linked National Models: A Tool For International Food Policy Analysis , 1988 .

[3]  John A. Tomlin,et al.  Implementing the Simplex Method for the Optimization Subroutine Library , 1992, IBM Syst. J..

[4]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[5]  B. Jansen,et al.  Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects , 1993 .

[6]  Nimrod Megiddo,et al.  Progress in Mathematical Programming , 1989 .

[7]  Sanjay Mehrotra,et al.  Higher order methods and their performance , 1990 .

[8]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

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

[10]  J. Gondzio.  Implimenting cholesky factorization for interior point methods of linear programming , 1993 .

[11]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

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

[13]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[14]  Jacek Gondzio,et al.  HOPDM: A higher order primal-dual method for large scale linear programming , 1993 .

[15]  Marek Makowski.  LP-DIT Data Interchange Tool for Linear Programming Problems (version 1.20) , 1994 .

[16]  Robert E. Bixby,et al.  Implementing the Simplex Method: The Initial Basis , 1992, INFORMS J. Comput..

[17]  Mwp Martin Savelsbergh,et al.  MP-DIT mathematical program data interchange tool , 1992 .

[18]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..