A method for solving bilevel linear programming problems
Calice Olivier Pieume, Laure Pauline Fotso, Patrick Siarry · Journal of Information and Optimization Sciences · 2008
This paper presents an approach for solving bilevel linear programming problems (BLPP). It is based on the result that an optimal solution to the BLPP is reachable at an extreme point of the underlying region. Consequently, we develop a pivot technique to find the global optimal solution on an expanded tableau that represents the data of the BLPP. The pivot technique allows to rank in increasing order the outer level objective function value until