An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks

This paper presents a “one-pass” algorithm that determines an “advanced” dual basic feasible solution for a class of capacitated generalized network problems. Special cases in this class of problems include transportation and transshipment problems. We include computational results that show that this new start substantially improves the solution performance of the dual method for transportation and transshipment problems. In fact, a dual code employing this advanced start is found to be faster (in terms of total solution time) than the fastest out-of-kilter code SUPERK on highly rectangular transportation problems.