Back to University of Twente portal
Linear bilevel problems: Genericity results and an efficient method for computing local minima
Frederiks, T.J. and Still, G.J. (2000) Linear bilevel problems: Genericity results and an efficient method for computing local minima. [Report]
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 135Kb |
| Abstract: | The paper is concerned with linear bilevel problems. These nonconvex problems are known to be NP-complete. So, no efficient method for solving the global bilevel problem can be expected. In this paper we give a genericity analysis of linear bilevel problems and present a new algorithm for computing efficiently local minimizers. The method is based on the given structural analysis and combines ideas of the Simplex method with projected gradient steps. |
| Item Type: | Report |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/65725 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page