Abstract:
This paper is an extension of the th-best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.

Keywords: A-T cut, bilevel linear integer programming, th-best approach, NAZ cut