Maximum and Minimum Cost Flow Finding in Networks in Fuzzy Conditions

The problems of the maximum and the minimum cost flow finding with zero and nonzero lower flow bounds are relevant, since they allow solving the problems of economic planning, logistics, transportation management, etc. In the area of transportation networks flow tasks enable to find the cargo transportation of the maximum volume between given points taking into account restrictions on the arc capacities of the cargo transmission paths, choose the routes of the optimal cost with the set lower flow bounds, which can be found after the profitability analysis of the cargo transportation along the particular road section. In considering these tasks it is necessary to take into account the inherent uncertainty of the network parameters, since environmental factors, measurement errors, repair work on the roads, the specifics of the constantly changing structure of the network influence the upper and lower flow bounds and transportation costs.