V. I. Tsurkov U.S.S.R. Comput. Math. Math. Phys. , vol.19, No.2 , 01.1980 , p. 73-86, language: английский ISSN 0041-5553  Аннотация A method is proposed for decompositoons of a general linear programming problem, when a part of them matrix has block-diagonal structure. The main point is the aggregation of variables. An iterative algorithms is constructed for solving branch planning problem, where aggregation introduction follows from the specificity of binding constraints and criterion.  Ключевые слова block-diagonal structure; aggregation of variables; specially structured constraints; decomposition method