A dual version of tardos's algorithm for linear programming

Authors:
James B Orlin
Affiliations:
Sloan School of Management, Massachusetts Institute of Technology, 50 Memorial Drive, Cambridge, MA 02139, USA
Venue:
Operations Research Letters
Year:
1986

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
A strongly polynomial minimum cost circulation algorithm

Combinatorica
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Mathematical Programming: Series A and B
A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Eva Tardos developed an algorithm for solving the linear program min (cx:Ax = b, x = 0 whose solution time is polynomial in the size of A, independent of the sizes of c and b. Her algorithm focuses on the dual LP and employs an approximation of the cost coefficients. Here we adopt what may be called a 'dual approach' in that if focuses on the primal LP. This dual approach has some significant differences from Tardo's approach which make the dual approach conceptually simpler.