IDEAS home Printed from https://ideas.repec.org/p/ehl/lserod/55610.html
   My bibliography  Save this paper

A polynomial projection-type algorithm for linear programming

Author

Listed:
  • Végh, László A.
  • Zambelli, Giacomo

Abstract

We propose a simple O([n5/logn]L)O([n5/logn]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work draws from Chubanov’s “Divide-and-Conquer” algorithm (Chubanov, 2012), with the recursion replaced by a simple and more efficient iterative method. A similar approach was used in a more recent paper of Chubanov (2013).

Suggested Citation

  • Végh, László A. & Zambelli, Giacomo, 2014. "A polynomial projection-type algorithm for linear programming," LSE Research Online Documents on Economics 55610, London School of Economics and Political Science, LSE Library.
  • Handle: RePEc:ehl:lserod:55610
    as

    Download full text from publisher

    File URL: http://eprints.lse.ac.uk/55610/
    File Function: Open access version.
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Daniel Dadush & László A. Végh & Giacomo Zambelli, 2020. "Rescaling Algorithms for Linear Conic Feasibility," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 732-754, May.

    More about this item

    Keywords

    Linear programming; Polynomial-time algorithms; Relaxation method;
    All these keywords.

    JEL classification:

    • J1 - Labor and Demographic Economics - - Demographic Economics

    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:ehl:lserod:55610. 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: LSERO Manager (email available below). General contact details of provider: https://edirc.repec.org/data/lsepsuk.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.