Abstract
Leontief substitution systems have been studied by economists and operations researchers for many years. We show how such linear systems are naturally viewed asLeontief 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 againfree 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Adler and S. Cosares, “Strongly polynomial algorithms for linear programming problems with special structure,” Working Paper, Department of IEOR, University of California (Berkeley, CA) and Bell Communications Research (Piscataway, NJ, 1989).
M.W. Bern, E.L. Lawler and A.L. Wong, “Linear time computation of optimal subgraphs of decomposable graphs,” Working Paper, Computer Science Division, University of California (Berkeley, CA, 1985).
B.A. Campbell, “Steiner tree problems on special planar graphs,” Ph.D. dissertation, Department of Industrial Engineering, Purdue University (West Lafayette, IN, 1987).
V. Chandru and J.N. Hooker, “Logical inference: A mathematical programming perspective,” Working Paper, CC-88-24, Purdue University (West Lafayette, IN, 1988).
A. Charnes and W.M. Raike, “One-pass algorithms for some generalized network problems,”Operations Research 14 (1966) 914–924.
S. Cosares and I. Adler, “Advantageous properties of dual transshipment polyhedra,” Working Paper, Department of Industrial Engineering and Operations Research, University of California (Berkeley, CA, 1987).
G.B. Dantzig, “Optimal solution of a dynamic Leontief model with substitution,”Econometrica 23 (1955) 295–302.
D. Dobkin, R.J. Lipton and S. Reiss, “Linear programming is log-space hard forP,”Information Processing Letters 8 (1979) 96–97.
W.F. Dowling and J.H. Gallier, “Linear time algorithms for testing the satisfiability of Horn formulae,”Journal of Logic Programming 1 (1984) 267–284.
J. Edmonds and R. Giles, “A min-max relation of submodular functions on graphs,” in: P.L. Hammer, et al., eds.Studies in Integer Programming, Annals of Discrete Mathematics 1 (1977) 185–204.
G.D. Eppen and R.K. Martin, “Solving multi-item capacitated lot-sizing problems using variable redefinition,”Operations Research 35 (1987) 832–848.
R.E. Erickson, “Minimum-concave-cost single-source network flows,” Ph.D. dissertation, Department of Operations Research, Stanford University (Stanford, CA, 1978).
R.E. Erickson, “Optimality of stationary halting policies and finite termination of successive approximations,”Mathematics of Operations Research 13 (1988) 90–98.
R.E. Erickson, C.L. Monma and A.F. Veinott, Jr., “Send-and-split method for minimum-concave-cost network flows”,Mathematics of Operations Research 12 (1987) 634–664.
F.R. Giles and W.R. Pulleyblank, “Total dual integrality and integer polyhedra,”Linear Algebra and its Applications 25 (1975) 191–196.
R.C. Grinold, “The Hirsch conjecture in Leontief substitution systems,”SIAM Journal on Applied Mathematics 21 (1971) 483–485.
R.A. Howard,Dynamic Programming and Markov Processes (MIT Press, Cambridge, MA, 1960).
R.G. Jeroslow, “Computation-oriented reductions of predicate to propositional logic,”Decision Support Systems 4 (1988) 183–197.
R.G. Jeroslow and J. Wang, “Dynamic programming, integral polyhedra, and Horn clause knowledge bases,”ORSA Journal on Computing 1 (1989) 7–19.
N.D. Jones and W.T. Laaser, “Complete problems for deterministic polynomial time,”Proceedings of Sixth Annual ACM Symposium on Theory of Computing, Seattle, WA, April 30–May 2, 1974, pp. 40–46.
J.G. Kemeny and J.L. Snell,Finite Markov Chains (Van Nostrand, Princeton, NJ, 1960).
L.G. Khachian, “A polynomial algorithm in linear programming,”Soviet Mathematics Doklady 20 (1979) 191–194.
G.J. Koehler, A.B. Whinston and G.P. Wright,Optimization Over Leontief Substitution Systems (North-Holland and American Elsevier, Amsterdam, New York, 1975).
W.W. Leontief,Structure of the American Economy, 1919–1939 (Oxford University Press, New York, 1951, 2nd ed.).
R.K. Martin, “Generating alternative mixed-integer programming models using variable redefinition,”Operations Research 35 (1987) 820–831.
R.K. Martin, R.L. Rardin and B.A. Campbell, “Polyhedral characterization of discrete dynamic programming,”Operations Research 38 (1990) 127–138.
U.G. Rothblum and P. Whittle, “Growth optimality for branching Markov decision chains,”Mathematics of Operations Research 7 (1982) 582–601.
A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986).
J.D. Ullman and A. Van Gelder, “Efficient test for top-down termination of logical rules,”Journal of the Association for Computing Machinery 35 (1988) 345–373.
A.F. Veinott, Jr., “Extreme points of Leontief substitution systems,”Linear Algebra and its Applications 1 (1968) 181–194.
A.F. Veinott, Jr., “Minimum concave-cost solution of Leontief substitution models of multi-facility inventory systems,”Operations Research 17 (1969a) 262–291.
A.F. Veinott, Jr., “Discrete dynamic programming with sensitive discount optimality criteria,”Annals of Mathematical Statistics 40 (1969b) 1635–1660.
H.M. Wagner, “On a class capacitated transportation problems,”Management Science 5 (1959) 304–318.
A. Walker, ed., M. McCord, J.F. Sowa and W.G. Wilson,Knowledge, Systems and Prolog (Addison-Wesley, Reading, MA, 1987).
T.V. Wimer, S.T. Hedetniemi and R. Laskar, “A methodology for constructing linear graph algorithms,”Congressus Numerantium 50 (1985) 43–60.
Author information
Authors and Affiliations
Additional information
Dedicated to the memory of Robert G. Jeroslow
See Acknowledgement section.
Research supported in part by the ONR (Office of Naval Research) under URI Grant number N00014-86-K-0689, and Center for Operations Research and Econometrics, Universite Catholique de Louvain.
Rights and permissions
About this article
Cite this article
Jeroslow, R.G., Martin, K., Rardin, R.L. et al. Gainfree Leontief substitution flow problems. Mathematical Programming 57, 375–414 (1992). https://doi.org/10.1007/BF01581090
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581090