| Article ID: | iaor19982384 |
| Country: | Netherlands |
| Volume: | 20 |
| Issue: | 3 |
| Start Page Number: | 101 |
| End Page Number: | 108 |
| Publication Date: | Mar 1997 |
| Journal: | Operations Research Letters |
| Authors: | Orlin James B., Ahuja Ravindra K. |
| Keywords: | programming: linear |
In this paper, we study the primal and dual simplex algorithms for the maximum flow problem. We show that any primal simplex algorithm for the maximum flow problem can be converted into a dual simplex algorithm that performs the same number of pivots and runs in the same time. The converse result is also true though in a somewhat weaker form.