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

Jacek Gondzio, Marek Makowski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)184-192
Number of pages9
JournalEuropean Journal of Operational Research
Issue number1
Publication statusPublished - 5 Jan 1995


  • Agriculture
  • Applications
  • Linear programming
  • Primal-dual method


Dive into the research topics of 'Solving a class of LP problems with a primal-dual logarithmic barrier method'. Together they form a unique fingerprint.

Cite this