Gainfree Leontief Substitution Flow Problems
(1992) Mathematical Programming — Vol. 57, n° 3, p. 375-414 (1992)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 2.47 MB
Details
- Authors
- Abstract
- Leontief substitution systems have been studied by economists and operations researchers for many rears. We show how such linear systems are naturally viewed as Leontief substitution flow problems on directed hypergraphs, and that important solution properties follow from structural characteristics of the hypergraphs. We give a strongly polynomial, non-simplex algorithm for Leontief substitution flow problems that satisfy a gainfree property leading to acyclic extreme solutions. Integrality conditions follow easily from this algorithm. Another structural property, support disjoint reachability, leads to necessary and sufficient conditions for extreme solutions to be binary. In a survey of applications, we show how the Leontief flow paradigm links polyhedral combinatorics, expert systems, mixed integer model formulation, and some problems in graph optimization.
- Affiliations
Citations
Jeroslow, RG., Martin, K., Rardin, RL., & Wang, JC. (1992). Gainfree Leontief Substitution Flow Problems. Mathematical Programming, 57(3), 375-414. https://doi.org/10.1007/BF01581090 (Original work published 1992)