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/

[1] Germeier Yu. B., Igry s neprotivopolozhnymi interesami, Nauka, M., 1976 | MR | Zbl

[2] Gorelik V. A., Kononenko A. F., Teoretiko-igrovye modeli prinyatiya reshenii v ekologo-ekonomicheskikh sistemakh, Radio i svyaz, M., 1982 | MR | Zbl

[3] Vasin A. A., Morozov V. V., Teoriya igr i modeli matematicheskoi ekonomiki, MAKS Press, M., 2005

[4] Bard J. F., Practical Bilevel Optimization, Kluwer Academic Publishers, Dordrecht, Netherlands, 1998 | MR

[5] Dempe S., Foundations of Bilevel Programming, Kluwer Academic Publishers, Dordrecht, Netherlands, 2002 | MR | Zbl

[6] Antipin A. S., “Ekstraproksimalnyi metod resheniya ravnovesnykh i igrovykh zadach”, Zhurn. vychisl. matem. i mat. fiziki, 45:11 (2005), 1969–1990 | MR | Zbl

[7] Luo Z.-Q., Pang J.-S., Ralph D., Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, 1996 | MR

[8] White D., Anandalingam G., “A penalty function approach for solving bi-level linear programs”, J. of global optimization, 3 (1993), 397–419 | DOI | MR | Zbl

[9] Liu G. S., Han J. Y., Zhang J. Z., “Exact penalty functions for convex bilevel programming problems”, J. of optimization theory and applications, 110:3 (2001), 621–643 | DOI | MR | Zbl

[10] Vasilev F. P., Metody optimizatsii, Faktorial-press, M., 2002

[11] Bazara M., Shetti K., Nelineinoe programmirovanie. Teoriya i algoritmy, Mir, M., 1982 | MR | Zbl

[12] Horst R., Tuy H., Global Optimization. Deterministic Approaches, Springer-Verlag, Berlin, 1993 | MR

[13] Strekalovskii A. S., Elementy nevypukloi optimizatsii, Nauka, Novosibirsk, 2003

[14] Strekalovskii A. S., Orlov A. V., Bimatrichnye igry i bilineinoe programmirovanie, Fizmatlit, M., 2007

[15] Strekalovskii A. C., “O minimizatsii raznosti dvukh vypuklykh funktsii na dopustimom mnozhestve”, Zhurn. vychisl. matem. i mat. fiziki, 43:3 (2003), 399–409 | MR | Zbl

[16] Strekalovsky A. S., Orlov A. V., “A new approach to nonconvex optimization”, Vychislitelnye metody i programmirovanie, 8:2 (2007), 11–27

[17] Orlov A. V., Strekalovskii A. S., “O chislennom poiske situatsii ravnovesiya v bimatrichnykh igrakh”, Zhurn. vychisl. matem. i mat. fiziki, 45:6 (2005), 983–997 | MR | Zbl

[18] Vasilev I. L., Klimentova K. B., Orlov A. V., “Parallelnyi globalnyi poisk ravnovesnykh situatsii v bimatrichnykh igrakh”, Vychislitelnye metody i programmirovanie, 8:2 (2007), 84–94

[19] Orlov A. V., “Chislennoe reshenie zadach bilineinogo programmirovaniya”, Zhurn. vychisl. matem. i mat. fiziki, 48:2 (2008), 237–254 | MR

[20] Calamai P., Vicente L., “Generating linear and linear-quadratic bilevel programming problems”, SIAM J. on Scientific Computing archive, 14:4 (1993), 770–782 | DOI | MR | Zbl

[21] Calamai P., Vicente L., “Generating qadratic bilevel programming test problems”, ACM Transactions on Mathematical Software, 20 (1994), 103–119 | DOI | MR | Zbl