ON THE EXISTENCE OF A FEASIBLE FLOW IN A STOCHASTIC TRANSPORTATION NETWORK

• 成果类型: Article
• 署名作者: PREKOPA, A; BOROS, E
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.39.1.119
• 发表日期: 1991
• 页码: 119-129
• 关键词: NETWORKS GRAPHS; STOCHASTIC TRANSPORTATION NETWORKS; probability; APPLICATIONS OF SHARP PROBABILITY INEQUALITIES; reliability; AVAILABILITY ANALYSIS IN POWER SYSTEMS

摘要

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.