| Article ID: | iaor19921487 |
| Country: | India |
| Volume: | 7 |
| Issue: | 2 |
| Start Page Number: | 91 |
| End Page Number: | 101 |
| Publication Date: | Aug 1991 |
| Journal: | International Journal of Management and Systems |
| Authors: | Das C., Patel D.K. |
A variant of Balinski’s signature method is presented for the solution of assignment problem. The pivot choice rule is independent of the value of the primal variables, hence change in the primal (dual) objective function may be positive, negative or zero. The computational complexity of the algorithm is of O(