Answers are grounded in this paper and cite their sources.
We describe an algorithm which converts a linear program min{cx ∣ Ax = b, x ≥ 0} to a network flow problem, using elementary row operations and nonzero variable-scaling, or shows that such a conversion is impossible. If A is in standard form, the computational effort required is bounded by O(rn), where r is the number of rows and n is the number of nonzero entries of A. A method for determining whether a “binary matroid” is “graphic” plays an important role in the algorithm.
No takes yet. Share an insight, caveat, or question.
Bixby et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: