Abstract
The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.
Similar content being viewed by others
References
J.F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik 4, 1962, 238–252.
D. Gale, A theorem of flows in networks, Pacific Journal of Mathematics 7, 1957, 1073–1082.
A.J. Hoffman, Some recent applications of the theory of linear inequalities to external combinatorial analysis,Proceedings Symposium on Applied Mathematics, Vol. 10, 1960, 113–128.
A. Prékopa and E. Boros, On the existence of a feasible flow in a stochastic transportation network, Operations Research 39, 1991, 119–129.
R.T. Rockafellar,Network Flows and Monotropic Optimization, Wiley, New York, 1984.
R. van Slyke and R.J-B Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM Journal of Applied Mathematics 17, 1969, 638–663.
S.W. Wallace and R.J-B Wets, Preprocessing in stochastic programming: The case of uncapacitated networks, ORSA Journal on Computing 1, 1989, 252–270.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ghannadan, S., Wallace, S.W. Feasibility in uncapacitated networks: The effect of individual arcs and nodes. Ann Oper Res 64, 197–210 (1996). https://doi.org/10.1007/BF02187646
Issue Date:
DOI: https://doi.org/10.1007/BF02187646