A polynomial projection-type algorithm for linear programming
Optimization and Control
2013-12-09 v3 Data Structures and Algorithms
Abstract
We propose a simple O([n^5/\log n]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 [4], where the recursion is replaced by a simple and more efficient iterative method. A similar approach was used in a more recent paper of Chubanov [6].
Cite
@article{arxiv.1307.4334,
title = {A polynomial projection-type algorithm for linear programming},
author = {László A. Végh and Giacomo Zambelli},
journal= {arXiv preprint arXiv:1307.4334},
year = {2013}
}