A primal-simplex based Tardos' algorithm
Optimization and Control
2014-09-09 v1
Abstract
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded by the dimension. Combining Orlin's primal-based modification and Mizuno's use of the simplex method, we introduce a modification of Tardos' algorithm considering only the primal problem and using simplex method to solve the auxiliary problems. The proposed algorithm is strongly polynomial if the coefficient matrix is totally unimodular and the auxiliary problems are non-degenerate.
Cite
@article{arxiv.1409.1999,
title = {A primal-simplex based Tardos' algorithm},
author = {Shinji Mizuno and Noriyoshi Sukegawa and Antoine Deza},
journal= {arXiv preprint arXiv:1409.1999},
year = {2014}
}
Comments
7 pages