Bilevel Linear Programming: Complexity and Equivalence to Minmax Problem

Citation:

J. F. Bard, “Bilevel Linear Programming: Complexity and Equivalence to Minmax Problem,” in Chapter 9, E. of Optimization, Pardalos, P. M., and Floudas, C. A., Ed. 2001, pp. 140–144.