The hierarchical model of branch planning with random coefficients

Detalhes bibliográficos
Autor(a) principal: Silva, G. N. [UNESP]
Data de Publicação: 1998
Outros Autores: Treskov, Yu P., Tsurkov, V. I.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://hdl.handle.net/11449/224780
Resumo: We consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem. Copyright © 1998 by MAHK Hayka/Interperiodica Publishing.
id UNSP_e81e167428a3b46ad465776e85f8471d
oai_identifier_str oai:repositorio.unesp.br:11449/224780
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling The hierarchical model of branch planning with random coefficientsWe consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem. Copyright © 1998 by MAHK Hayka/Interperiodica Publishing.Departamento de Ciéncias de Computaco e Estatistica IBILCE UNESP, Sao José do Rio Preto/SPDepartment of Complex Systems Computing Center Russian Academy of Sciences, ul. Vavilova 40, Moscow, 117967Departamento de Ciéncias de Computaco e Estatistica IBILCE UNESP, Sao José do Rio Preto/SPUniversidade Estadual Paulista (UNESP)Russian Academy of SciencesSilva, G. N. [UNESP]Treskov, Yu P.Tsurkov, V. I.2022-04-28T20:08:16Z2022-04-28T20:08:16Z1998-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article622-630Journal of Computer and Systems Sciences International, v. 37, n. 4, p. 622-630, 1998.1064-2307http://hdl.handle.net/11449/2247802-s2.0-33746314362Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengJournal of Computer and Systems Sciences Internationalinfo:eu-repo/semantics/openAccess2022-04-28T20:08:16Zoai:repositorio.unesp.br:11449/224780Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T22:35:02.677501Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv The hierarchical model of branch planning with random coefficients
title The hierarchical model of branch planning with random coefficients
spellingShingle The hierarchical model of branch planning with random coefficients
Silva, G. N. [UNESP]
title_short The hierarchical model of branch planning with random coefficients
title_full The hierarchical model of branch planning with random coefficients
title_fullStr The hierarchical model of branch planning with random coefficients
title_full_unstemmed The hierarchical model of branch planning with random coefficients
title_sort The hierarchical model of branch planning with random coefficients
author Silva, G. N. [UNESP]
author_facet Silva, G. N. [UNESP]
Treskov, Yu P.
Tsurkov, V. I.
author_role author
author2 Treskov, Yu P.
Tsurkov, V. I.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (UNESP)
Russian Academy of Sciences
dc.contributor.author.fl_str_mv Silva, G. N. [UNESP]
Treskov, Yu P.
Tsurkov, V. I.
description We consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem. Copyright © 1998 by MAHK Hayka/Interperiodica Publishing.
publishDate 1998
dc.date.none.fl_str_mv 1998-12-01
2022-04-28T20:08:16Z
2022-04-28T20:08:16Z
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. 37, n. 4, p. 622-630, 1998.
1064-2307
http://hdl.handle.net/11449/224780
2-s2.0-33746314362
identifier_str_mv Journal of Computer and Systems Sciences International, v. 37, n. 4, p. 622-630, 1998.
1064-2307
2-s2.0-33746314362
url http://hdl.handle.net/11449/224780
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 622-630
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_ 1808129440305119232

Registros relacionados