Local search in a quadratic-linear bilevel programming problem
Alexander S. Strekalovsky, A. V. Orlov, А. В. Малышев · Numerical Analysis and Applications · 2010
A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a nonconvex mathematical programming problem with a quadratic-bilinear structure. An approximate algorithm of a local search in the problem obtained is proposed, proved, and tested.