|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2010, Volume 13, Number 1, Pages 75–88
(Mi sjvm269)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
A local search for the quadratic-linear bilevel programming problem
A. S. Strekalovsky, A. V. Orlov, A. V. Malyshev Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences
Abstract:
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.
Key words:
bilevel programming, optimistic solution, non-convex optimization problems, local search, test problems generating, computational simulation.
Received: 25.06.2009 Revised: 09.10.2009
Citation:
A. S. Strekalovsky, A. V. Orlov, A. V. Malyshev, “A local search for the quadratic-linear bilevel programming problem”, Sib. Zh. Vychisl. Mat., 13:1 (2010), 75–88; Num. Anal. Appl., 3:1 (2010), 59–70
Linking options:
https://www.mathnet.ru/eng/sjvm269 https://www.mathnet.ru/eng/sjvm/v13/i1/p75
|
Statistics & downloads: |
Abstract page: | 602 | Full-text PDF : | 126 | References: | 70 | First page: | 16 |
|