A computational study of global algorithms for linear bilevel programming (Q596661)

The authors analyse two global algorithms for solving the linear bilevel programming problem of the form \(\max_{x,y}\, c^T_1 x+ c^T_2y\) s.t. \(B_1x+ B_2y\leq b\), \(x\geq 0\) where \(y\) solves: \(\max_y\, d^Ty\) s.t. \(A_1x+ A_2y\leq a\), \(y\geq 0\). The first one is a recent algorithm built on a new concept of equilibrium point and a modified version of the outer approximation method. The second one is an efficient branch-and-bound algorithm. Based on computational results, some modification in both algorithms are proposed.