eprintid: 4280 rev_number: 7 eprint_status: archive userid: 351 dir: disk0/00/00/42/80 datestamp: 2016-01-15 02:05:13 lastmod: 2021-08-27 17:15:03 status_changed: 2016-01-15 02:05:13 type: article metadata_visibility: show item_issues_count: 2 creators_name: Gondzio, J. creators_name: Makowski, M. creators_id: 1254 creators_orcid: 0000-0002-6107-0972 title: Solving a class of LP problems with primal-dual logarithmic barrier method ispublished: pub internal_subjects: iis_das internal_subjects: iis_met divisions: prog_mda keywords: Agriculture; Applications; Linear programming; Primal-dual method abstract: 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. date: 1995 date_type: published publisher: Elsevier id_number: 10.1016/0377-2217(93)E0323-P iiasapubid: XJ-95-053 iiasa_bibref: European Journal of Operational Research; 80(1):184-192 [1995] creators_browse_id: 193 full_text_status: none publication: European Journal of Operational Research volume: 80 number: 1 pagerange: 184-192 refereed: TRUE issn: 0377-2217 coversheets_dirty: FALSE fp7_type: info:eu-repo/semantics/article citation: Gondzio, J. & Makowski, M. ORCID: 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 .