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.
Fulltext:
PDF file (259 kB)
