Journal
MATHEMATICAL METHODS OF OPERATIONS RESEARCH
Volume 55, Issue 3, Pages 383-400Publisher
PHYSICA-VERLAG GMBH & CO
DOI: 10.1007/s001860200189
Keywords
linear bilevel programming; genericity results; numerical methods
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available