I. S. Litvinchev ,   G. N. Silva ,   Y. P. Treskov Известия РАН. Теория и системы управления , 2 , 01.1999 , p. 84-94, language: английский  Аннотация Aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and aggregation-disaggregation scheme is applied to such a divisionally organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources, allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information, provided by the divisions.  Ключевые слова aggregation, decomposition, two-level organizaton, optimization