Optimal Solution of a Dynamic Leontief Model with Substitution

DOI10.2307/1910385MaRDI QIDQ3230729zbMATH OpenOpenAlexWikidataFDO

Authors George Dantzig

Publication date 1955

Published in Econometrica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1910385

zbMATH Keywords

Mathematical biology, operations research

Cited in

(17)

• Hidden Z-matrices with positive principal minors
• Triangulations (tilings) and certain block triangular matrices
• Maximum-stopping-value policies in finite Markov population decision chains
• Triangularity of the basis in linear programs for material requirements planning
• Solving staircase linear programs by the simplex method, 1: Inversion
• On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
• Generalized \(P_ 0\)- and \(Z\)-matrices
• Markov branching decision chains with interest-rate-dependent rewards
• Polyhedral sets having a least element
• On cone orderings and the linear complementarity problem
• Aggregation of inputs and outputs prior to data envelopment analysis under big data
• Toric orbit spaces which are manifolds
• Iterative descent method for generalized Leontief model
• Gainfree Leontief substitution flow problems
• Beiträge zur Dekomposition von linearen Programmen
• The generalized Leontief input-output model and its application to the choice of new technology
• Extreme points of Leontief substitution systems

This page was built for publication: Optimal Solution of a Dynamic Leontief Model with Substitution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3230729)