LPINT: LP Software Based on the Interior Point Method

  • Janez Barle
  • Janez Grad
Conference paper


Karmarkar’s algorithm (Karmarkar 1984) and other interior point methods are now regarded as a competitive methods for solving linear programming (LP) problems. It is therefore worth-while to undertake development of a professional LP software based on some particular interior point method. We describe design and implementation aspects of LPINT, an LP software package which is based on the primal-dual interior point algorithm.


  1. Alvarado F.L. (1990) Manipulation and visualization of sparse matrices. ORSA Journal on Computing 2: 187–207CrossRefGoogle Scholar
  2. Duff I.S., Erisman A.M., Reid J.K. (1989) Direct Methods for Sparse Matrices. Clarendon Press. OxfordGoogle Scholar
  3. Gay D.M. (1985) Electronic Mail Distribution of Linear Programming Test Problems. Mathematical Programming Society COAL Newsletter 13: 10–12Google Scholar
  4. George J.A., Liu J.W. (1981) Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall. Englewood CliffsGoogle Scholar
  5. Karmarkar N.K. (1984) A New Polynomial-Time Algorithm for Linear Programming. Combinatorica 4: 373–395CrossRefGoogle Scholar
  6. Lustig I.J., Marsten R.E., Shanno D.F. (1991) Computational Experience with a Primal-Dual Interior Point Method For Linear Programming. Linear Algebra and its Applications 152: 191–222CrossRefGoogle Scholar
  7. Suhl U.H. (1989) Design and Implementation of a Fast and Portable LP-Optimizer. Operations Research Proceedings 1988. Springer Verlag. Berlin Heideberg: 165–173CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Janez Barle
    • 1
  • Janez Grad
    • 1
  1. 1.Ekonomska fakultetaLjubljanaSlovenia

Personalised recommendations