Linear Bilevel Programming: Continuous Variables
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.
KeywordsSearch Tree Logical Relation Complementary Slackness Inducible Region Complementary Slackness Condition
Unable to display preview. Download preview PDF.