We consider the problem of maximizing the flow from one node to another in an oriented network subject to flow conservation and capacity limitation constraints and the additional constraint that for some nodes a certain positive linear combination of flows entering the node is bounded. Several properties of solutions to this problem are developed and a heuristic method for its solution is presented.