Problems of efficient application and development of a network under capital investments and credits

The problem of maximization of profit in the operation of a communication network is solved as a linear programming problem of large dimensionality both with respect to the number of constraints (up to several thousands), and with respect to the number of variables (up to several millions). The original problem is reduced to a finite sequence of linear programming problems with the number of constraints lower by one order of magnitude and the number of variables up to several billions. The problems of the sequence are solved using the modified simplex method with generation of columns. The problems of maximization of profit of the owner of the upgraded network who leases channels are solved for limited capital investments and for the case of drawing up a credit, and the optimal amount of credit is determined. Solution algorithms based on the procedure of separation of variables are proposed. Numerical examples are presented.