GENERATING QUADRATIC BILEVEL PROGRAMMING TEST PROBLEMS

This paper describes a technique for generating sparse or dense quadra tic bilevel programming problems with a selectable number of known glo bal and local solutions. The technique described here does not require the solution of any subproblems. In addition, since most techniques f or solving these problems begin by solving the corresponding relaxed q uadratic program, the global solutions are constructed to be different than the global solution of this relaxed problem in a selectable numb er of upper- and lower-level variables. Finally, the problems that are generated satisfy the requirements imposed by all of the solution tec hniques known to the authors.