The "Arrangement Method" for Linear Programming is Equivalent to the Phase-One Method

Koltun’s arrangement method for linear programming is shown to be equivalent to using the simplex method to solve the standard so-called Phase I problem with artificial variables.

By: Elad Hazan; Nimrod Megiddo

Published in: RJ10414 in 2007


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .