期刊文献+

OPTIMALITY CONDITIONS FOR NONCONVEX BILEVEL PROGRAMMING PROBLEMS 被引量:2

OPTIMALITY CONDITIONS FOR NONCONVEX BILEVEL PROGRAMMING PROBLEMS
下载PDF
导出
摘要 In this paper, we derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially calm is presented and a necessary optimality condition for nonconvex bilevel programming problems is given. Some existing results about the differentiability of the value function of the lower level programming problem are extended and a sufficient condition for CRCQ to hold for VS form of BLPP with linear lower level programming problem is also given. In this paper, we derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially calm is presented and a necessary optimality condition for nonconvex bilevel programming problems is given. Some existing results about the differentiability of the value function of the lower level programming problem are extended and a sufficient condition for CRCQ to hold for VS form of BLPP with linear lower level programming problem is also given.
出处 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1997年第2期183-192,共10页
关键词 OPTIMALITY conditions NONCONVEX bilevel programming problem EXACT PENALTY FUNCTION value FUNCTION constraint qualification. Optimality conditions, nonconvex bilevel programming problem, exact penalty function, value function, constraint qualification.
  • 相关文献

同被引文献17

引证文献2

二级引证文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部