The feasible diferential problem is solved using a tension rectifcation algorithm. In this paper, we present a scaling implementation of a tension rectifcation algorithm. Let n; m;U denote the number of nodes, number of arcs, and maximum arc capacity value of an arc, respectively. Our implementation runs in O(mnlog U), which is O(mnlog n) under the similarity assumption. The tension rectifcation algorithm runs in O(m2) time, so, our implementation is an improvement if n log n < m. Another merit of our algorithm is that, in cases where the feasible diferential problem does not have a solution, it presents some information that is useful to the modeler in estimating the maximum cost of adjusting the network.
