Gainfree Leontief substitution flow problems

DOI10.1007/BF01581090zbMath0778.90080OpenAlexW2060416492MaRDI QIDQ1802953

Jinchang Wang, Ronald L. Rardin, Robert G. Jeroslow, R. Kipp Martin

Publication date: 29 June 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581090

zbMATH Keywords

expert systemspolyhedral combinatoricsdirected hypergraphsLeontief substitution systemsLeontief matricesLeontief substitution flow problemsupport disjoint reachability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Deterministic network models in operations research (90B10) Multisectoral models in economics (91B66)

Related Items (18)

Characterizing consistency in probabilistic logic for a class of Horn clauses ⋮ Totally unimodular Leontief directed hypergraphs ⋮ Flows on hypergraphs ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Max Horn SAT and the minimum cut problem in directed hypergraphs ⋮ A simplex algorithm for a class of Leontief flow problems ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ Facets of the Stochastic Network Flow Problem ⋮ Using separation algorithms to generate mixed integer model reformulations ⋮ Lot sizing with inventory gains ⋮ Integrated optimization of strategic and tactical planning decisions in forestry ⋮ Sensitivity analysis for Horn formulae ⋮ The demand weighted vehicle routing problem ⋮ A Hypergraph Network Simplex Algorithm ⋮ Towards the Use of Hypergraphs in Multi-adjoint Logic Programming ⋮ The hypergraph assignment problem ⋮ Inference flexibility in Horn clause knowledge bases and the simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total dual integrality and integer polyhedra
• Linear programming is log-space hard for P
• Extreme points of Leontief substitution systems
• On a Class of Capacitated Transportation Problems
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Advantageous Properties of Dual Transhipment Polyhedra
• Polyhedral Characterization of Discrete Dynamic Programming
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Growth Optimality for Branching Markov Decision Chains
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Linear-time computation of optimal subgraphs of decomposable graphs
• One-Pass Algorithms for Some Generalized Network Problems
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
• The Hirsch Conjecture in Leontief Substitution Systems

This page was built for publication: Gainfree Leontief substitution flow problems