Degeneracy in transportation problems
The paper provides a systematic study of degeneracy as it appears in transportation problems. First the relationship between the degeneracy and the geometry of a transportation polytope is dicussed. Formulae for the minimum and maximum number of vertices are given. This part presents some new results. In the succeeding discussion the authors develop the basis of a procedure for generating transportation problems with various degree of degeneracy. Two such families of problems were solved using the program GNET (a general purpose transshipment problem solver). Interesting computational experiences and conclusions are also presented.
general purpose transshipment problem solver
scientific article; zbMATH DE number 3972630