Anzeige
Erschienen in:
1997 | OriginalPaper | Buchkapitel
The Stackelberg Problem: Linear and Convex Case
verfasst von : Kiyotaka Shimizu, Yo Ishizuka, Jonathan F. Bard
Erschienen in: Nondifferentiable and Two-Level Mathematical Programming
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The vast majority of research on two-level programming has centered on the linear Stackelberg game, alternatively known as the linear bilevel programming problem (BLPP). 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.