The presented thesis discusses bilevel programming problems with the focus on solution algorithms. Bilevel programming problem is a hierarchical programming problem, where constraints contain another programming problem. We formulate basic bilevel optimization theory and describe three types of so- lution algorithms for bilevel programming problems: Algorithms based on KKT reformulation where the lower level is replaced by its KKT conditions, algorithms based on optimal value function where the bilevel programming problem is re- duced to a single level problem using the optimal value function of the lower level problem, and algorithms solving linear bilevel programming problems. Using real data for portfolio optimization bilevel programming problems, we compare ability to solve the problems and computing time of some of the pre- sented algorithms. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:393504 |
| Date | January 2019 |
| Creators | Lžičař, Jiří |
| Contributors | Kopa, Miloš, Branda, Martin |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.002 seconds