An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
The 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. Computational results are included which 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 SEPERK on highly rectangular transportation problems.
- Operations Research