This paper presents two methods for increasing the traffic handling capability of a communication network with a minimum cost. Although we concentrate on traffic between one pair of stations (one commodity), the first formulation can be extended to the case of

flows (or

commodities). Both methods lead to a linear programming procedure, because linear cost increase is assumed.