On the Equivalence of Some Generalized Network Problems to Pure Network Problems
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1972
- Accession Number
- AD0742065
Entities
People
- D. Klingman
- Fred W. Glover
Organizations
- University of Texas at Austin