Local search in a quadratic-linear bilevel programming problem |
| |
| Authors: | A. S. Strekalovsky A. V. Orlov A. V. Malyshev |
| |
| Affiliation: | 1. Institute of System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, ul. Lermontova 134, Irkutsk, 664033, Russia
|
| |
| Abstract: | ![]()
A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a nonconvex mathematical programming problem with a quadratic-bilinear structure. An approximate algorithm of a local search in the problem obtained is proposed, proved, and tested. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
