Abstract
We consider the problem of finding a feasible flow in a directed networkG = (N,A) in which each nodei ∈ N has a supplyb(i), and each arc(i,j) ∈ A has a zero lower bound on flow and an upper boundu ij . It is well known that this feasibility problem can be transformed into a maximum flow problem. It is also well known that there is no feasible flow in the networkG if and only if there is a subsetS of nodes such that the net supplies of the nodes inS exceeds the capacity of the arcs emanating fromS. Such a setS is called a“witness of infeasibility” (or, simply, awitness) of the network flow problem. In the case that there are many different witnesses for an infeasible problem, a small cardinality witness may be preferable in practice because it is generally easier for the user to assimilate, and may provide more guidance to the user on how to identify the cause of the infeasibility. Here we show that the problem of finding a minimum cardinality witness is NP-hard. We also consider the problem of determining aminimal witness, that is, a witnessS such that no proper subset ofS is also a witness. In this paper, we show that we can determine a minimal witness by solving a sequence of at mostn maximum flow problems. Moreover, if we use the preflow-push algorithm to solve the resulting maximum flow problems and organize computations properly, then the total time taken by the algorithm is comparable to that of solving a single maximum flow problem. This approach determines a minimal cardinality witness in O(n 2 m 1/2) time using simple data structures and in O(nm logn) time using the standard implementation of the dynamic tree data structures. We also show that the recognition version of the minimal witness problem is equivalent to a recognition version of a related problem known as theminimum rooted cut problem. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
Similar content being viewed by others
References
J.N.M. Van Loon, Irreducibly inconsistent systems of linear inequalities, European Journal of Operations Research 8 (1981) 283–288.
J.W. Chinneck, E.E. Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal of Computing 3 (1991) 157–168.
H.J. Greenberg, Diagnosing infeasibility of min-cost network flow models, Part II, Primal infeasibility, IMA Journal of Mathematics in Business and Industry 4 (1988) 39–50.
H.J. Greenberg, How to analyze the results of linear programs — Part 3: Infeasibility diagnosis, Interfaces 23 (1993) 120–139.
D. Gale, A theorem on flows in networks, Pacific Journal of Mathematics 7 (1957) 1073–1082.
R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a graph. Proceedings of the Third Annual ACM-Siam Symposium on Discrete Algorithms, 1992, pp. 165–174 (expanded version accepted for publication by the Journal of Algorithms).
G. Gallo, M.D. Gridoriadis, R.E. Tarjan, A fast parametric flow algorithm, SIAM Journal of Computing 18 (1989) 30–55.
A.V. Goldberg, R.E. Tarjan, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921–940.
U. Derigs, W. Meier, Implementing Goldberg's max-flow algorithm: A computational investigation, Zeitschrift für Operations Research 33 (1989) 383–403.
J. Cheriyan, S.N. Maheshwari, Analysis of preflow push algorithms for maximum network flow, SIAM Journal on Computing 6 (1989) 1057–1086.
D.D. Sleator, R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences 24 (1983) 362–391.
M.S. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1989.
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Aggarwal, C.C., Ahuja, R.K., Hao, J. et al. Diagnosing infeasibilities in network flow problems. Mathematical Programming 81, 263–280 (1998). https://doi.org/10.1007/BF01580084
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580084