Maximum flow in a network with fuzzy arc capacities

Our main concern is the maximum flow in a network in which an excess over the beforehand fixed quota of arc capacity is admissible. The problem is represented as a partially fuzzy linear programming task. A theorem equivalent to the Ford and Fulkerson one concerning the classic task of maximum flow is proved in the paper. An algorithm for searching maximum flow assuming integer values of flows on network arcs is presented.