Extreme points of Leontief substitution systems
From MaRDI portal
Publication:2532765
DOI10.1016/0024-3795(68)90002-5zbMath0174.51503OpenAlexW1999465562MaRDI QIDQ2532765
Publication date: 1968
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(68)90002-5
Related Items
An effective algorithm for the capacitated single item lot size problem ⋮ Error bound for the dynamic lot size model with backlogging ⋮ Totally unimodular Leontief directed hypergraphs ⋮ Minimizing the error bound for the dynamic lot size model ⋮ Flows on hypergraphs ⋮ Triangularity of the basis in linear programs for material requirements planning ⋮ A simplex algorithm for a class of Leontief flow problems ⋮ Polyhedral sets having a least element ⋮ Facets of the Stochastic Network Flow Problem ⋮ Economic lot sizing problem with inventory bounds ⋮ On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem ⋮ Markov Branching Decision Chains with Interest-Rate-Dependent Rewards ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Gainfree Leontief substitution flow problems ⋮ Hidden Z-matrices with positive principal minors ⋮ On cone orderings and the linear complementarity problem ⋮ A pathological case in the reduction of linear programs ⋮ Solving the drift control problem ⋮ Triangulations (tilings) and certain block triangular matrices ⋮ A new dynamic programming algorithm for the single item capacitated dynamic lot size model ⋮ Inference flexibility in Horn clause knowledge bases and the simplex method
Cites Work
