Experimental comparisons of codes for long transportation problems (Q1086155)

The main purpose of this note is to discuss a new approach for solving the L.P. Transportation Problem, which can be formulated as follows: \[ \min imize\quad \sum C_{ij}X_{ij}\quad subject\quad to\quad \sum_{i}X_{ij}b_ j\sum_{j}X_{ij}=a_ i;\quad X_{ij}\geq 0,\quad 1\leq i\leq m;\quad 1\leq j\leq n. \] The experiments presented here show that this approach is superior, at least for problems with \(m\ll n\).