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

Georg Still

Mathematical Methods of Operations Research, 2002, vol. 55, issue 3, 383-400

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. Copyright Springer-Verlag Berlin Heidelberg 2002

Keywords: Key words: linear bilevel programming; genericity results; numerical methods; Mathematical Subject Classification 1991: 90C26 (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200189 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:55:y:2002:i:3:p:383-400

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200189

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().