IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v16y1986i4p75-90.html
   My bibliography  Save this article

Karmarkar’s Linear Programming Algorithm

Author

Listed:
  • J. N. Hooker

    (Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

N. Karmarkar’s new projective scaling algorithm for linear programming has caused quite a stir in the press, mainly because of reports that it is 50 times faster than the simplex method on large problems. It also has a polynomial bound on worst-case running time that is better than the ellipsoid algorithm’s. Radically different from the simplex method, it moves through the interior of the polytope, transforming the space at each step to place the current point at the polytope’s center. The algorithm is described in enough detail to enable one to write one’s own computer code and to understand why it has polynomial running time. Some recent attempts to make the algorithm live up to its promise are also reviewed.

Suggested Citation

  • J. N. Hooker, 1986. "Karmarkar’s Linear Programming Algorithm," Interfaces, INFORMS, vol. 16(4), pages 75-90, August.
    • Handle: RePEc:inm:orinte:v:16:y:1986:i:4:p:75-90
    DOI: 10.1287/inte.16.4.75
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.16.4.75
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.16.4.75?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Konstantin Gorbunov & Vassily Lyubetsky, 2024. "Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness," Mathematics, MDPI, vol. 12(6), pages 1-26, March.

    More about this item

    Keywords

    programming; linear: algorithms;

    Statistics

    Access and download statistics

    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:inm:orinte:v:16:y:1986:i:4:p:75-90. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.