Numerical solution of a class of bilevel programming problems
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 series of nonconvex unilevel problems. An approximate algorithm for global search in reduced problems is proposed. Numerical solutions of randomly generated test problems are given and analyzed.