Linear bilevel problems: Genericity results and an efficient method for computing local minima

Georg J. Still

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)

Abstract

The paper is concerned with linear bilevel problems. These nonconvex problems are known to be NP-complete. So, no theoretically 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 efficiently computing local minimizers. The method is based on the given structural analysis and combines ideas of the Simplex method with projected gradient steps.
Original languageEnglish
Pages (from-to)383-400
JournalMathematical methods of operations research
Volume55
Issue number3
DOIs
Publication statusPublished - 2002

Keywords

  • METIS-208599

Fingerprint Dive into the research topics of 'Linear bilevel problems: Genericity results and an efficient method for computing local minima'. Together they form a unique fingerprint.

Cite this