Solving multicommodity transportation problems using a primal partitioning simplex technique

This paper presents the details for applying and specializing the work of Saigal [28] and Hartman and Lasdon [16] to develop a primal partitioning code for the multicommodity transportation problem. The emphasis of the paper is in presenting efficient data structure techniques for exploiting the underlying network structure of this class of problems. Computational experience with test problems whose corresponding linear programming formulation has over 400 rows and 2,000 columns is presented.