摘要
针对无上层约束的线性双层规划问题提出一种改进的K最好方法(Kth-best方法).理论和算例证明该方法在不需要原Kth-best方法的前提条件下可以有效地解决线性双层规划问题.
A modified Kth-best approach was presented for linear bilevel programming with no upper-level constraint. We proved that this modified Kth-best approach obtained via the theoretical proof and example can solve effectively linear bilevel programming with no upper-level constraint without the assumption of original Kth-best approach.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2008年第6期1031-1036,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:J0630104)
吉林大学“985工程”项目基金(批准号:20080112)
关键词
线性双层规划
K最好方法
全局最优解
无上层约束
linear bilevel programming
Kth-best approach
global optimization solution
no upper-level constraint