Linear Bilevel Programming: Continuous Variables

  • Jonathan F. Bard
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 30)


The vast majority of research on bilevel programming has centered on the linear version of the problem, alternatively known as the linear Stackelberg game. In this chapter we present several of the most successful algorithms that have been developed for this case, and when possible, compare their performance. We begin with some basic notation and a discussion of the theoretical character of the problem.


Search Tree Logical Relation Complementary Slackness Inducible Region Complementary Slackness Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Jonathan F. Bard
    • 1
  1. 1.Graduate Program in Operations Research, Department of Mechanical EngineeringThe University of TexasAustinUSA

Personalised recommendations