Aggregation-based decomposition for multi-divisional models

Detalhes bibliográficos
Autor(a) principal: Litvinchev, I. S.
Data de Publicação: 1999
Outros Autores: Silva, G. N. [UNESP], Treskov, P. Yu [UNESP]
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://hdl.handle.net/11449/224792
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. Copyright © 1999 by MAK Hayka/Interperiodica.
id UNSP_9ad828df27d28cfbf04ea638acb0569a
oai_identifier_str oai:repositorio.unesp.br:11449/224792
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Aggregation-based decomposition for multi-divisional modelsThe 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. Copyright © 1999 by MAK Hayka/Interperiodica.Computing Center Russian Academy of Sciences, MoscowDCCE/IBILCE/UNESP, S. J. Rio PretoDCCE/IBILCE/UNESP, S. J. Rio PretoComputing Center Russian Academy of SciencesUniversidade Estadual Paulista (UNESP)Litvinchev, I. S.Silva, G. N. [UNESP]Treskov, P. Yu [UNESP]2022-04-28T20:08:19Z2022-04-28T20:08:19Z1999-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article244-254Journal of Computer and Systems Sciences International, v. 38, n. 2, p. 244-254, 1999.1064-2307http://hdl.handle.net/11449/2247922-s2.0-33747435511Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengJournal of Computer and Systems Sciences Internationalinfo:eu-repo/semantics/openAccess2022-04-28T20:08:19Zoai:repositorio.unesp.br:11449/224792Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T20:08:19Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Aggregation-based decomposition for multi-divisional models
title Aggregation-based decomposition for multi-divisional models
spellingShingle Aggregation-based decomposition for multi-divisional models
Litvinchev, I. S.
title_short Aggregation-based decomposition for multi-divisional models
title_full Aggregation-based decomposition for multi-divisional models
title_fullStr Aggregation-based decomposition for multi-divisional models
title_full_unstemmed Aggregation-based decomposition for multi-divisional models
title_sort Aggregation-based decomposition for multi-divisional models
author Litvinchev, I. S.
author_facet Litvinchev, I. S.
Silva, G. N. [UNESP]
Treskov, P. Yu [UNESP]
author_role author
author2 Silva, G. N. [UNESP]
Treskov, P. Yu [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Computing Center Russian Academy of Sciences
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Litvinchev, I. S.
Silva, G. N. [UNESP]
Treskov, P. Yu [UNESP]
description 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. Copyright © 1999 by MAK Hayka/Interperiodica.
publishDate 1999
dc.date.none.fl_str_mv 1999-12-01
2022-04-28T20:08:19Z
2022-04-28T20:08:19Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv Journal of Computer and Systems Sciences International, v. 38, n. 2, p. 244-254, 1999.
1064-2307
http://hdl.handle.net/11449/224792
2-s2.0-33747435511
identifier_str_mv Journal of Computer and Systems Sciences International, v. 38, n. 2, p. 244-254, 1999.
1064-2307
2-s2.0-33747435511
url http://hdl.handle.net/11449/224792
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Journal of Computer and Systems Sciences International
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 244-254
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1797789458219663360

Registros relacionados