首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A New Variant of Penalty Method for Weak Linear Bilevel Programming Problems
Authors:June Liu  Yunfei Hong  Yue Zheng
Institution:1.School of Management,Huaibei Normal University,Huaibei, Anhui,China;2.School of Information and Mathematics,Yangtze University,Jingzhou, Hubei,China
Abstract:We present a new variant of penalty method, which is different from the existing penalty methods, for solving the weak linear bilevel programming problems. We then transform it into a single-level optimization problem using Kuhn-Tucker optimality condition and discuss the relations between them. Finally, two examples are used to illustrate the feasibility of the proposed penalty method.
Keywords:
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号