Optimal flow in networks with gains and costs

The problem of routing a desired flow at minimum cost through a network in which associated with each arc is a capacity, a linear cost, a fixed cost and a flow multiplier is considered. The equivalence of the problems on a general graph and a bipartite graph is shown; feasibility is discussed and properties of solutions are investigated.