On the Existence of a Feasible Flow in a Stochastic Transportation Network

András Prékopa and Endre Boros
Additional contact information
András Prékopa: Rutgers University, New Brunswick, New Jersey
Endre Boros: Rutgers University, New Brunswick, New Jersey

Operations Research, 1991, vol. 39, issue 1, 119-129

Abstract: Many transportation networks, e.g., networks of cooperating power systems, and hydrological networks involve a real-valued demand function, defined on the set of nodes, and it is said to be feasible if there exists a flow such that at each node the sum of the incoming flow values is greater than or equal to the demand assigned to this node. By the theorem of D. Gale and A. Hoffman, a system of linear inequalities involving the demand and the arc capacity functions, gives necessary and sufficient condition for the feasibility of the demand. If the demands and/or the arc capacities are random, then an important problem is to find the probability that all these inequalities are satisfied. This paper proposes a new method to eliminate all redundant inequalities for given lower and upper bounds of the demand function, and finds sharp lower and upper bounds for the probability that a feasible flow exists. The results can be used to support transportation network analysis and design.

Keywords: networks/graphs: stochastic transportation networks; probability: applications of sharp probability inequalities; reliability: availability analysis in power systems (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.1.119 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:1:p:119-129

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().