Страница публикации

The local and global searches in bilevel problems with a matrix game at the lower level

Авторы: Orlov A.V., Gruzdeva T.V.

Журнал: Lecture Notes in Computer Science : Proc. of the 18th Intern. Conf. on Mathematical Optimization Theory and Operations Research (MOTOR'2019; Ekaterinburg)

Том: 11548 LNCS

Номер:

Год: 2019

Отчётный год: 2019

Издательство:

Местоположение издательства:

URL:

Аннотация: This work addresses the simplest class of the bilevel optimization problems (BOPs) with equilibrium at the lower level. We study linear BOPs with a matrix game at the lower level in their optimistic statement. First, we transform this problem to a single-level nonconvex optimization problem with the help of the optimality conditions for the lower level problem. Then we apply the special Global Search Theory (GST) for general d.c. optimization problems to the reduced problem. Following this theory, the methods of local and global searches in this problem are constructed. These methods take into account the structure of the problem in question.

Индексируется WOS: 1

Индексируется Scopus: 1

Индексируется РИНЦ: 1

Публикация в печати: 0

Добавил в систему: