Consider the minimum cost flow problem with the additional constraints that the total flow of the outgoing arcs from each node i must lie within a given range
![1550_1d82d0ff-c909-4acc-bd14-067dafde4e3f.png](https://secure.tutorsglobe.com/CMSImages/1550_1d82d0ff-c909-4acc-bd14-067dafde4e3f.png)
Convert this problem into the standard form of the minimum cost flow problem by splitting each node into two nodes with a connecting arc.