The dual linear programs for the transhipment problem over a directed graph, $G = \{ N,E\} $, are shown to have polyhedra with properties that make them well suited to vertex visiting solution techniques, like the simplex method. In particular, nondegenerate cases are shown to have feasible regions with considerably fewer extreme points than the feasible sets for primal problems. The adjacency structure of feasible bases is also shown to be quite favorable. In fact, the Hirsch Conjecture is valid when the network is complete. A dual-based simplex method for cases of the transhipment problem, which include the shortest paths problem, is presented that finds an optimal solution in no more than $\text{Min}( | E | - | N | + 1, | N | | N - 1 |/2 )$ pivots.
['Ilan Adler', 'Steven Cosares']
Advantageous Properties of Dual Transhipment Polyhedra