Global Solution of Bilevel Programming Problems

Sonja Steffensen ()
Additional contact information
Sonja Steffensen: RWTH Aachen University

A chapter in Operations Research Proceedings 2014, 2016, pp 575-580 from Springer

Abstract: Abstract We discuss the global solution of Bilevel Programming ProblemsSteffensen, Sonja using their reformulations as Mathematical Programs with Complementarity Constraints and/or Mixed Integer Nonlinear Programs. We show that under suitable assumptions the Bilevel Program can be reformulated and globally solved via MINLP refomulation. We also briefly discuss some simplifications and suitable additional constraints.

Keywords: Global Solution; Bilevel Program; Revenue Management; Complementarity Constraint; Stationarity Condition (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_80

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_80

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().