<mets:mets OBJID="eprint_4587" 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:02:49Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4587_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>A Penalty Based Simplex Method for Linear Programming</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">A.</mods:namePart><mods:namePart type="family">Swietanowski</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>We give a general description of a new advanced implementation of the simplex method for linear programming. The method ``decouples'' a notion of the simplex basic solution into two independent entities: a solution and a basis. This generalization makes it possible to incorporate new strategies into the algorithm since the iterates no longer need to be the vertices of the simplex. An advantage of such approach is a possibility of taking steps along directions that are not simplex edges (in principle they can even cross the interior of the feasible set). It is exploited in our new approach to finding the initial solution in which global infeasibility is handled through a dynamically adjusted penalty term. &#13;
&#13;
We present several new techniques that have been incorporated into the method. These features include: previously mentioned method for finding an initial solution; an original approximate steepest edge pricing algorithm; dynamic adjustment of the penalty term. &#13;
&#13;
The presence of the new crashing and restart procedures based on the penalty term make the algorithm particularly suitable for sequential ``warm start'' calls when solving subproblems in decomposition approaches. The same features may be used in post optimal analysis. &#13;
&#13;
The efficiency of the new features is demonstrated when running the method on a subset of difficult linear programs from the NETLIB collection.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995-01</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-95-005</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4587"><mets:rightsMD ID="rights_eprint_4587_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:fileGrp USE="reference"><mets:file ID="eprint_4587_4145_1" SIZE="1115412" OWNERID="https://pure.iiasa.ac.at/id/eprint/4587/1/WP-95-005.pdf" MIMETYPE="application/pdf"><mets:FLocat LOCTYPE="URL" xlink:type="simple" xlink:href="https://pure.iiasa.ac.at/id/eprint/4587/1/WP-95-005.pdf"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4587_mods" ADMID="TMD_eprint_4587"><mets:fptr FILEID="eprint_4587_document_4145_1"></mets:fptr></mets:div></mets:structMap></mets:mets>