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