A characterization of irreducible infeasible subsystems in flow networks
Author(s)
Joormann, Imke; Pfetsch, Marc E.; Orlin, James B
DownloadFlow-Networks-iis-James-Orlin.pdf (325.3Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Infeasible network flow problems with supplies and demands can be characterized via violated cut-inequalities of the classical Gale-Hoffman theorem. Written as a linear program, irreducible infeasible subsystems (IISs) provide a different means of infeasibility characterization. In this article, we answer a question left open in the literature by showing a one-to-one correspondence between IISs and Gale-Hoffman-inequalities in which one side of the cut has to be weakly connected. We also show that a single max-flow computation allows one to compute an IIS. Moreover, we prove that finding an IIS of minimal cardinality in this special case of flow networks is strongly NP-hard.
Date issued
2016-08Department
Sloan School of ManagementJournal
Networks
Publisher
Wiley Blackwell
Citation
Joormann, Imke et al. “A Characterization of Irreducible Infeasible Subsystems in Flow Networks.” Networks 68, 2 (June 2016): 121–129 © 2016 Wiley Periodicals, Inc
Version: Author's final manuscript
ISSN
0028-3045
1097-0037