Cookies?
Library Header Image
LSE Research Online LSE Library Services

A polynomial projection-type algorithm for linear programming

Végh , László A. and Zambelli, Giacomo (2014) A polynomial projection-type algorithm for linear programming. Operations Research Letters, 42 (1). pp. 91-96. ISSN 0167-6377

Full text not available from this repository.

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).

Item Type: Article
Official URL: http://www.journals.elsevier.com/operations-resear...
Additional Information: © 2014 Elsevier B.V.
Library of Congress subject classification: H Social Sciences > HB Economic Theory
Q Science > QA Mathematics
Sets: Departments > Management
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 10 Feb 2014 12:20
URL: http://eprints.lse.ac.uk/55610/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only