Global search for guaranteed solutions in quadratic-linear bilevel optimization problems

A quadratic-linear bilevel optimization problem with guaranteed (pessimistic) solution is considered. It is reduced to a series of optimistic bilevel optimization problems, which are further reduced to nonconvex optimization problems. Global and local search algorithms for the latter problems are developed. The results of computational solving randomly generated test problems are given and analyzed.