Los puntos clave no están disponibles para este artículo en este momento.
We show, using small examples, that two algorithms previously published for the Bilevel Linear Programming problem (BLP) may fail to find the optimal solution and thus must be considered to be heuristics. A proof is given that solving BLP problems is NP-hard, which makes it unlikely that there is a good, exact algorithm.
Ben‐Ayed et al. (Fri,) studied this question.