Optimal Solution of a Dynamic Leontief Model with Substitution
From MaRDI portal
Publication:3230729
DOI10.2307/1910385zbMATH Open0068.33404OpenAlexW2316442505WikidataQ56049004 ScholiaQ56049004MaRDI QIDQ3230729FDOQ3230729
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
Cited In (17)
- Triangulations (tilings) and certain block triangular matrices
- Hidden Z-matrices with positive principal minors
- Maximum-stopping-value policies in finite Markov population decision chains
- Solving staircase linear programs by the simplex method, 1: Inversion
- Triangularity of the basis in linear programs for material requirements planning
- 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
- Beiträge zur Dekomposition von linearen Programmen
- Gainfree Leontief substitution flow problems
- 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)
