Nie masz uprawnień do wyświetlenia tego obiektu. Aby poprosić o dostęp do niego, wypełnij poniższe pola.
Karbowski, Andrzej
2004, nr 3
artykuł
We consider the optimization problems which may be solved by the direct decomposition method. It is possible when the performance index is a monotone function of other performance indices, which depend on two subsets of decision variables: an individual for every inner performance index and a common one for all. Such problems may be treated as a generalization of separable problems with the additive cost and constraints functions. In the paper both the underlying theory and the basic numerical techniques are presented and compared. A special attention is paid to the guarantees of convergence in different classes of problems and to the effectiveness of calculations.
Instytut Łączności - Państwowy Instytut Badawczy, Warszawa
application/pdf
oai:bc.itl.waw.pl:531
10.26636/jtit.2004.3.256
1509-4553
1899-8852
Journal of Telecommunications and Information Technology
ang
Biblioteka Naukowa Instytutu Łączności
10 cze 2024
11 mar 2010
273
https://ribes-54.man.poznan.pl/publication/593
RDF
OAI-PMH
Mazurkiewicz, Tomasz
Kutin, Artem I.
Dursun, Yunus
Hai, Ngo Thanh Khoa, Dang Le
Styl cytowania: Chicago ISO690 Chicago
Ta strona wykorzystuje pliki 'cookies'. Więcej informacji Rozumiem