A dual version of Tardos's algorithm for linear programming (Q581226): Difference between revisions

The author considers a linear programming problem of the form min(cx: \(Ax=b\), \(x\geq 0)\) with integer coefficients. Similar to Tardos' approach which solves the dual program in time polynomial in the size of A, the author develops an algorithm which solves the primal program in time polynomial in the size of A. Some significant differences between the two methods are also discussed.