On the Equivalence of Some Generalized Network Problems to Pure Network Problems
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
The purpose of the paper is to show that any generalized network problem whose matrix does not have full row rank is equivalent to a pure network problem. Furthermore, the authors develop an efficient procedure which may be used simultaneously to determine the rank of the incidence matrix and transform if possible the generalized network problem into a pure problem. Transforming such problems into pure network problems provides several advantages, such as Increasing computational efficiency Eliminating roundoff error Providing a simple check for infeasibility Extending the results in the literature on pure networks to appropriate generalized networks.
- Operations Research