Consider a minimum cost network problem which aims to send 12 units of products from node A to node E with minimum cost. The first graph below, shows the lower bound, upper bound, and per unit cost of the flow (lij,uij,cij ) for each arc. A basic feasible solution is also given in the second graph below. Red arrows indicate the basic arcs(T) and the values on arcs indicate the current flow