期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 142, 期 3, 页码 444-462出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(01)00307-1
关键词
semi-infinite programming; bilevel programming; optimality conditions; genericity behavior; numerical methods
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. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据