| Article ID: | iaor19911365 |
| Country: | United States |
| Volume: | 38 |
| Issue: | 3 |
| Start Page Number: | 189 |
| End Page Number: | 195 |
| Publication Date: | May 1990 |
| Journal: | Operations Research |
| Authors: | Ben-Ayed Omar, Blair Charles E. |
The authors 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.