V. I. Tsurkov ,   A. P. Tizik Sov. J. Comput. Syst. Sci. , vol.28 No.2 , 01.1990 , p. 24-31, language: английский ISSN 0882-4002  Аннотация We examine the problem of distributing channels in a primary network as one of linear programming with high dimensionality. The problem is solved by the Dantzig-Wolfe method. The essential interpretation of the condition for optimality of a solution is discussed. Two algorithms for finding optimal paths are proposed, which take into account the specific features of the problem being solved.  Ключевые слова linear programming, large-scale problem, optimality, Dantzig-Wolfe method