Abstract
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a special case of a (BL). We consider the so-called reduction approach for (BL) and (GSIP) leading to optimality conditions and Newton-type methods for solving the problems. We show by a structural analysis that for (GSIP)-problems the regularity assumptions for the reduction approach can be expected to hold generically at a solution but for general (BL)-problems not. The genericity behavior of (BL) and (GSIP) is in particular studied for linear problems.
| Original language | English |
|---|---|
| Pages (from-to) | 444-462 |
| Journal | European journal of operational research |
| Volume | 142 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2002 |
Keywords
- IR-74650
- METIS-208601
- Genericity behavior
- Optimality conditions
- Numerical methods
- Semi-infinite programming
- Bilevel programming