It is shown that a number of fundamental optimal routing and design problems
for communication networks consisting of facilities for transmission, switching,
relaying, etc., may be treated in a straightforward, computationally feasible
manner by linear programming methods. These methods provide a general system
approach for resolving the complex interactions among system capacities, users'
demands, and economic factors. Various aspects of implementation and generalizations
are discussed.
