A pivot generation approach for the classical Hitchcock transportation problem

The Hitchcock transportation problem is a widely studied and used problem. In this paper, a new approach based on a brief method to pivot in dual simplex method in the particular case of a transportation problem is briefly described and a small instance is solved to illustrate the proposed procedure. Computational results show that the new approach can be significantly faster than previous solution methods for small to medium‐sized instances.