The hierarchical model of branch planning with random coefficients

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.contributorRussian Academy of Sciences-
Autor(es): dc.creatorSilva, G. N.-
Autor(es): dc.creatorTreskov, Yu P.-
Autor(es): dc.creatorTsurkov, V. I.-
Data de aceite: dc.date.accessioned2025-08-21T22:12:31Z-
Data de disponibilização: dc.date.available2025-08-21T22:12:31Z-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued1998-12-01-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/224780-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/224780-
Descrição: dc.descriptionWe 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.-
Descrição: dc.descriptionDepartamento de Ciéncias de Computaco e Estatistica IBILCE UNESP, Sao José do Rio Preto/SP-
Descrição: dc.descriptionDepartment of Complex Systems Computing Center Russian Academy of Sciences, ul. Vavilova 40, Moscow, 117967-
Descrição: dc.descriptionDepartamento de Ciéncias de Computaco e Estatistica IBILCE UNESP, Sao José do Rio Preto/SP-
Formato: dc.format622-630-
Idioma: dc.languageen-
Relação: dc.relationJournal of Computer and Systems Sciences International-
???dc.source???: dc.sourceScopus-
Título: dc.titleThe hierarchical model of branch planning with random coefficients-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.