Affiliation:
1. Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran
Abstract
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 [Formula: see text]-minimum cost flow model with a prespecified confidence level [Formula: see text], 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 [Formula: see text] such that for it, the feasible set of [Formula: see text]-minimum cost flow model is nonempty. Finally, a numerical example is presented to illustrate the efficiency of our proposed method.
Publisher
World Scientific Pub Co Pte Lt
Subject
Management Science and Operations Research,Management Science and Operations Research
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献