A Discussion on the branch-and-bound Approach to Linear Bilevel Programming

This paper gives an analysis of the branch-and-bound approach to linear bilevel programming.A designed example shows that the current branch-and-bound approach can't deal with a linear bilevel programming problem well when the constraint functions at the upper-level are of arbitrary linear form.Then based on the new definition of linear bilevel programming solution, this paper gives an extended branch-and-bound approach to the linear bilevel programming.The numerical results show that the extended branch-and-bound approach can solve the deficiency efficiently.