Aggregation-based decomposition for multi-divisional models
Nenhuma Miniatura disponível
Data
1999-03-01
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Springer
Tipo
Artigo
Direito de acesso
Acesso restrito
Resumo
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.
Descrição
Palavras-chave
Idioma
Inglês
Como citar
Journal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica/springer, v. 38, n. 2, p. 244-254, 1999.