Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
From MaRDI portal
Publication:3035117
DOI10.1093/imaman/2.1.39zbMath0692.90046OpenAlexW2081387735MaRDI QIDQ3035117
Publication date: 1989
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/2.1.39
diagnosticsmin-cost network flow problemcause of infeasibilityflow augmenting pathsprimal infeasibility
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (7)
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 ANALYZE rulebase for supporting LP analysis ⋮ Diagnosing infeasibilities in network flow problems ⋮ The facets of the polyhedral set determined by the Gale-Hoffman inequalities
This page was built for publication: Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
