Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
From MaRDI portal
Publication:3833848
DOI10.1093/imaman/1.2.99zbMath0677.90029OpenAlexW2034645921MaRDI QIDQ3833848
Publication date: 1987
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/1.2.99
Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
How to compute least infeasible flows, Consistency, redundancy, and implied equalities in linear systems, Finding the minimum weight IIS cover of an infeasible system of linear inequalities, Complexity of minimum irreducible infeasible subsystem covers for flow networks, The diameters of network-flow polytopes satisfy the Hirsch conjecture, The ANALYZE rulebase for supporting LP analysis, MINOS(IIS): Infeasibility analysis using MINOS
