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

Mathematical Methods of Operations Research

Volumn 55, Issue 3, 2002, Pages 383-400

  Still, Georg ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Genericity results; Linear bilevel programming; Numerical methods

Indexed keywords

GENETIC ALGORITHMS; MATRIX ALGEBRA; NUMERICAL METHODS; PROBLEM SOLVING;

GENERICITY ANALYSIS; LINEAR BILEVEL PROBLEMS;

LINEAR PROGRAMMING;

EID: 0036609863     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860200189     Document Type: Article

References (14)

1. A branch and bound algorithm for the bilevel programming problem
2. Computational difficulties of bilevel linear programming
3. A hybrid tabu-ascent algorithm for the linear bilevel programming problem
4. Topological stability of smooth mappings
5. New branch-and-bound rules for linear bilevel programming
6. Generalized semi-infinite optimization and bilevel optimization
7. Anandalingam, a penalty function approach for solving bilevel linear problems