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

T.J. Frederiks, Georg J. Still

Research output: Book/ReportReportOther research output

104 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2000

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-90C26
  • IR-65725
  • EWI-3358

Cite this