On generalized semi-infinite optimization and bilevel optimization

Share/Save/Bookmark

Stein, Oliver and Still, Georg (2002) On generalized semi-infinite optimization and bilevel optimization. European Journal of Operational Research, 142 (3). pp. 444-462. ISSN 0377-2217

[img]PDF
Restricted to UT campus only
: Request a copy
202Kb
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.
Item Type:Article
Copyright:© 2002 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74650
Official URL:http://dx.doi.org/10.1016/S0377-2217(01)00307-1
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 208601