A Global Convergent Algorithm for Solving the Mixed Integer Bilevel Linear Programming Problem
一种混合整数双层线性规划的全局优化方法

The mixed integer bilevel linear programming problem(MIBLPP),where the upper-level decision maker controls all zero-one variable and the lower-level decision maker controls all continuous variables, is discussed. By solving the extreme points of the follower's dual problem, the MIBLPP is decomposed into a series of mixed integer linear program problems. Using mixed integer linear program methods, a global optimal solution to the MIBLPP can be obtained.