<mets:mets OBJID="eprint_4280" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T23:15:06Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4280_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>Solving a class of LP problems with primal-dual logarithmic barrier method</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">J.</mods:namePart><mods:namePart type="family">Gondzio</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">M.</mods:namePart><mods:namePart type="family">Makowski</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods: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.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Elsevier</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4280"><mets:rightsMD ID="rights_eprint_4280_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4280_mods" ADMID="TMD_eprint_4280"></mets:div></mets:structMap></mets:mets>