Numerical solution of a class of bilevel programming problems

The quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a series of non-convex mathematical programming problems. An approximate algorithm of the global search in the problems obtained is proposed. Numerical solutions of randomly generated test problems are given and analyzed.