TY - INPR A1 - Horländer, Andreas A1 - Schmidt, Martin T1 - A Penalty Branch-and-Bound Method for Mixed-Integer Quadratic Bilevel Problems N2 - We propose an algorithm for solving bilevel problems with mixed-integer convex-quadratic upper level as well as convex-quadratic and continuous lower level. The method is based on a classic branch-and-bound procedure, where branching is performed on the integer constraints and on the complementarity constraints resulting from the KKT reformulation of the lower-level problem. However, instead of branching on constraints as usual, suitably chosen penalty terms are added to the objective function in order to create new subproblems in the tree. We prove the correctness of the method and present its applicability by some first numerical results. KW - Bilevel optimization KW - Branch-and-bound KW - Penalty methods KW - Mixed-integer optimization Y1 - 2022 ER -