Розв’язання нелінійних оптимізаційних задач розподілу ресурсів у великих блочно-структурованих системах зі зв’язуючими параметрами
Solving non-linear optimization problems with a block structure and binding parameters (variables) is realized by a combination of the approximation and decomposition approaches. The approximation method is chosen so that the decomposition of the mathematical programming problem can be performed wit...
Gespeichert in:
| Datum: | 2016 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | Ukrainisch |
| Veröffentlicht: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2016
|
| Schlagworte: | |
| Online Zugang: | http://journal.iasa.kpi.ua/article/view/85428 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | System research and information technologies |
Institution
System research and information technologies| Zusammenfassung: | Solving non-linear optimization problems with a block structure and binding parameters (variables) is realized by a combination of the approximation and decomposition approaches. The approximation method is chosen so that the decomposition of the mathematical programming problem can be performed without making any assumptions about the convexity or additive separability of objective functions and constraints. The coordinating and block sub-problems that are auxiliary in the approximation method, are solved using a finite number of steps. In the course of calculation, binding variables vary from step to step of the iterative process, providing a monotonic decrease of the value of the coordinating problem objective function; in other words, the amount of shared resources is changed in such a way that block subsystems operate more and more efficiently in terms of the efficiency of the whole system. |
|---|