Aggregation-based decomposition for multi-divisional models
Loading...
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Type
Article
Access right
Acesso restrito
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.
Description
Keywords
Language
English
Citation
Journal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica/springer, v. 38, n. 2, p. 244-254, 1999.
