A decomposition method for flux problems in a network

For the problem of finding the circulation of minimal price in a network a decomposition method is proposed whereby the initial problem is reduced to subproblems of lower dimension on circulation of the minimal price and a related linear programming subproblem.