Российская академия наук    
     
   

Общая информация


 
Login Print view Help 

Поиск атрибутный
  Организаций
  Персон

Структура учреждений РАН




The Hierarchical Model of Branch Planning with Random Coefficients

 Аннотация

    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.

 Ключевые слова

    branch model, subsystems, decomposition, quadratic programming, block structure
 


Последние изменения: 22.02.2001


119991 Москва, Ленинский просп., 14
Телефон: (495) 938-0309 (Справ. бюро); Факс: (495) 954-3320 (Лен.пр.14), (495) 938-1844 (Лен.пр,32а)
На главную страницу
В начало страницы
© РАН 2007