Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors

被引:0
|
作者
Bhawna Kohli
机构
[1] University of Delhi,Department of Mathematics
关键词
Bilevel programming problem; Value function; Convexifactor; Constraint qualifications; Optimality conditions; 90C26; 90C46;
D O I
暂无
中图分类号
学科分类号
摘要
In this article, we introduce two versions of nonsmooth extension of Abadie constraint qualification in terms of convexifactors and Clarke subdifferential and employ the weaker one to develop new necessary Karush–Kuhn–Tucker type optimality conditions for optimistic bilevel programming problem with convex lower-level problem, using an upper estimate of Clarke subdifferential of value function in variational analysis and the concept of convexifactor.
引用
收藏
页码:632 / 651
页数:19
相关论文
共 50 条