Tytuł:

Direct method of hierarchical nonlinear optimization - reassessment after 30 years, Journal of Telecommunications and Information Technology, 2004, nr 3

Autor:

Karbowski, Andrzej

Temat i słowa kluczowe:

decomposition ; distributed com-putations ; Benders method ; hierarchical optimization ; the directmethod ; cutting plane method

Opis:

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.

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy, Warszawa

Data wydania:

2004, nr 3

Typ zasobu:

artykuł

Format:

application/pdf

DOI:

10.26636/jtit.2004.3.256

ISSN:

1509-4553

eISSN:

1899-8852

Źródło:

Journal of Telecommunications and Information Technology

Język:

ang

Prawa:

Biblioteka Naukowa Instytutu Łączności