Pages that link to "Item:Q2532765"

The following pages link to Extreme points of Leontief substitution systems (Q2532765):

Displaying 24 items.

• On cone orderings and the linear complementarity problem (Q754772) (← links)
• Triangularity of the basis in linear programs for material requirements planning (Q1119175) (← links)
• Hidden Z-matrices with positive principal minors (Q1260088) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
• An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
• Flows on hypergraphs (Q1373748) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
• Gainfree Leontief substitution flow problems (Q1802953) (← links)
• A pathological case in the reduction of linear programs (Q1837107) (← links)
• Totally unimodular Leontief directed hypergraphs (Q1904049) (← links)
• Minimizing the error bound for the dynamic lot size model (Q1904609) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Economic lot sizing problem with inventory bounds (Q2456418) (← links)
• Error bound for the dynamic lot size model with backlogging (Q2638915) (← links)
• Markov branching decision chains with interest-rate-dependent rewards (Q2805311) (← links)
• Solving the drift control problem (Q3466714) (← links)
• Triangulations (tilings) and certain block triangular matrices (Q3688133) (← links)
• Facets of the Stochastic Network Flow Problem (Q5124001) (← links)
• Polyhedral sets having a least element (Q5657902) (← links)
• On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem (Q5965390) (← links)
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)
• On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)
• Projection methods for finding the greatest element of the intersection of max-closed convex sets (Q6638853) (← links)