Option of Network Flow Problem Considering Uncertain Arc Capacity Constraints

불확실한 arc용량제약식들을 고려한 네트워크문제의 최적화

In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.