Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Twente, Faculty of Mathematical Science, P.O. Box 217, 7500 AE Enschede, The Netherlands (e-mail: g.still@math.utwente.nl), NL

    Georg Still

Authors
  1. Georg Still
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: September 2000/Final version received: December 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Still, G. Linear bilevel problems: Genericity results and an efficient method for computing local minima. Mathematical Methods of OR 55, 383–400 (2002). https://doi.org/10.1007/s001860200189

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860200189

Search

Navigation