The hierarchical model of branch planning with random coefficients
Loading...
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Maik Nauka/interperiodica
Type
Article
Access right
Acesso restrito
Abstract
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.
Description
Keywords
Language
English
Citation
Journal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica, v. 37, n. 4, p. 622-630, 1998.
