A Global Convergent Algorithm for Solving the Mixed Integer Bilevel Linear Programming Problem.

A global optimization method for solving a mixed integer bilevel linear programming problem where the upper-level decision maker controls all discrete variables and the lower-level decision maker controls all continuous variables is proposed. By searching for a better bound from the natural relaxation, the proposed algorithm based on the branch- and-bound technique can terminate at an optimal solution to the problem in finite number of steps. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. [ABSTRACT FROM AUTHOR]