Geodesic
A local search for the quadratic-linear bilevel programming problem
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 1, pp. 75-88

Voir la notice de l'article provenant de la source Math-Net.Ru

The quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a non-convex mathematical programming problem with the quadratic-bilinear structure. An approximate algorithm of a local search in the problem obtained is proposed, proved and tested. 
@article{SJVM_2010_13_1_a6,
     author = {A. S. Strekalovsky and A. V. Orlov and A. V. Malyshev},
     title = {A local search for the quadratic-linear bilevel programming problem},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {75--88},
     publisher = {mathdoc},
     volume = {13},
     number = {1},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a6/}
}
TY  - JOUR
AU  - A. S. Strekalovsky
AU  - A. V. Orlov
AU  - A. V. Malyshev
TI  - A local search for the quadratic-linear bilevel programming problem
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2010
SP  - 75
EP  - 88
VL  - 13
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a6/
LA  - ru
ID  - SJVM_2010_13_1_a6
ER  - 
%0 Journal Article
%A A. S. Strekalovsky
%A A. V. Orlov
%A A. V. Malyshev
%T A local search for the quadratic-linear bilevel programming problem
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2010
%P 75-88
%V 13
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a6/
%G ru
%F SJVM_2010_13_1_a6
A. S. Strekalovsky; A. V. Orlov; A. V. Malyshev. A local search for the quadratic-linear bilevel programming problem. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 1, pp. 75-88. http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a6/