https://pure.iiasa.ac.at/id/eprint/4280 2021-08-27T17:15:03Z info:eu-repo/semantics/descriptiveMetadata https://pure.iiasa.ac.at/id/eprint/4280/ Solving a class of LP problems with primal-dual logarithmic barrier method Gondzio, J. Makowski, M. 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. Elsevier 1995 Article PeerReviewed Gondzio, J. & Makowski, M. <https://pure.iiasa.ac.at/view/iiasa/193.html> ORCID: https://orcid.org/0000-0002-6107-0972 <https://orcid.org/0000-0002-6107-0972> (1995). Solving a class of LP problems with primal-dual logarithmic barrier method. European Journal of Operational Research 80 (1) 184-192. 10.1016/0377-2217(93)E0323-P <https://doi.org/10.1016/0377-2217%2893%29E0323-P>. 10.1016/0377-2217(93)E0323-P 10.1016/0377-2217(93)E0323-P 10.1016/0377-2217(93)E0323-P info:eu-repo/semantics/humanStartPage