Aggregation-based decomposition for multi-divisional models

Abstract

The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a 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.