IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v5y2009i4p408-428.html
   My bibliography  Save this article

Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1

Author

Listed:
  • Daniel Solow
  • Hans Halim

Abstract

An open question pertaining to the simplex algorithm is where phase 1 terminates on the feasible region. Here, computer simulations support the conjecture that phase 1 terminates at a feasible point geometrically close to the starting point. This observation leads to a coordinate transformation for bounded Linear Programs (LP) that requires fewer iterations in phase 2. This is confirmed by computational experiments on random LPs and Netlib problems and shows generally increasing benefits as the number of negative coefficients in the minimisation objective function increases. Though not winning on all Netlib problems, the coordinate transformation saves 2–11% of the CPU time.

Suggested Citation

  • Daniel Solow & Hans Halim, 2009. "Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 5(4), pages 408-428.
    • Handle: RePEc:ids:ijores:v:5:y:2009:i:4:p:408-428
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=25701
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:5:y:2009:i:4:p:408-428. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.