A Multi-Commodity Concave Cost Minimization Problem for Communication Networks

摘要

In this network synthesis problem a matrix giving flow requirements between each pair of points is specified, and the cost of flow in each arc is a concave function of the amount of flow. A flow pattern which fulfills the requirements at minimum cost is sought. The problem is formulated as a concave programming problem with linear constraints. All the practical difficulties of formulation and theoretical difficulties of identifying the globally minimal solution while avoiding locally minimal solutions are discussed. (Author)