Abstract:
The paper in concerned with the problem of determining the throughputs of network arcs and the capacities in its vertices so as to transmit the specified flux through a network during its functioning and minimize a linear function which representee costs of network conversion. An algorithm is proposed whereby alternating problems of the maximal flux are solved in a time-stretched version of the original network and of linear programming.