Geodesic
Numerical solution of a~class of bilevel programming problems
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 2, pp. 201-212

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 series of non-convex mathematical programming problems. An approximate algorithm of the global search in the problems obtained is proposed. Numerical solutions of randomly generated test problems are given and analyzed. 
@article{SJVM_2010_13_2_a4,
     author = {A. S. Strekalovsky and A. V. Orlov and A. V. Malyshev},
     title = {Numerical solution of a~class of bilevel programming problems},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {201--212},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2010_13_2_a4/}
}
TY  - JOUR
AU  - A. S. Strekalovsky
AU  - A. V. Orlov
AU  - A. V. Malyshev
TI  - Numerical solution of a~class of bilevel programming problems
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2010
SP  - 201
EP  - 212
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2010_13_2_a4/
LA  - ru
ID  - SJVM_2010_13_2_a4
ER  - 
%0 Journal Article
%A A. S. Strekalovsky
%A A. V. Orlov
%A A. V. Malyshev
%T Numerical solution of a~class of bilevel programming problems
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2010
%P 201-212
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2010_13_2_a4/
%G ru
%F SJVM_2010_13_2_a4
A. S. Strekalovsky; A. V. Orlov; A. V. Malyshev. Numerical solution of a~class of bilevel programming problems. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 2, pp. 201-212. http://geodesic.mathdoc.fr/item/SJVM_2010_13_2_a4/