| Article ID: | iaor20102841 |
| Volume: | 36 |
| Issue: | 4 |
| Start Page Number: | 402 |
| End Page Number: | 407 |
| Publication Date: | Jul 2008 |
| Journal: | Operations Research Letters |
| Authors: | Punnen Abraham P, Kabadi Santosh N |
| Keywords: | simplex algorithm |
In this paper we show that the complexity of the simplex method for the linear fractional assignment problem (LFAP) is strongly polynomial. Although LFAP can be solved in polynomial time using various algorithms such as Newton's method or binary search, no polynomial time bound for the simplex method for LFAP is known.