On generalized semi-infinite optimization and bilevel optimization

On generalized semi-infinite optimization and bilevel optimization

0.00 Avg rating0 Votes
Article ID: iaor20032044
Country: Netherlands
Volume: 142
Issue: 3
Start Page Number: 444
End Page Number: 462
Publication Date: Nov 2002
Journal: European Journal of Operational Research
Authors: ,
Keywords: bilevel optimization
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.

Reviews

Required fields are marked *. Your email address will not be published.