Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

The Minimum Cost Flow Problem of Uncertain Random Network

    https://doi.org/10.1142/S0217595918500161Cited by:2 (Source: Crossref)

    The aim of this paper is to present a novel method for solving the minimum cost flow problem on networks with uncertain-random capacities and costs. The objective function of this problem is an uncertain random variable and the constraints of the problem do not make a deterministic feasible set. Under the framework of uncertain random programming, a corresponding α-minimum cost flow model with a prespecified confidence level α, is formulated and its main properties are analyzed. It is proven that there exists an equivalence relationship between this model and the classical deterministic minimum cost flow model. Then an algorithm is proposed to find the maximum amount of α such that for it, the feasible set of α-minimum cost flow model is nonempty. Finally, a numerical example is presented to illustrate the efficiency of our proposed method.