In this paper, we present a algorithm to find locally optimal solutions of bilevel linear problems. At each current feasible point, the method search for better solutions that lie in their adjacent faces. Each iteration tries to find adjacent faces having large dimension, to accelerate the process. A proof of correctness is given, and computacional tests were realized.
Bilevel programming; bilevel linear programming; local optimum
