期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 61, 期 4, 页码 769-788出版社
SPRINGER
DOI: 10.1007/s10898-014-0200-4
关键词
Bilevel optimization problem; Convexificators; Necessary optimality conditions; Support function
In this paper we adapt the main results from Amahroq and Gadhi (J Glob Optim 21:435-443, 2001) for a general set-valued optimization problem to an optimistic bilevel programming problem as an optimization problem with implicitly given set-valued constraint. Since this constraint is assumed to be upper but not lower semicontinuous in the sense of Berge, we need to deal with a lower semicontinuous distance function to this mapping. In order to approximate the gradient of the distance function, we introduce a new concept for a directional convexificator. Some calculus rules for this new tool are adapted and several properties are characterized. The main result presents optimality conditions for an optimistic bilevel programming problem using a convexificator constructed with the aid of the directional convexificator.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据