A solution approach to the weak linear bilevel programming problems

被引：17
|
作者：
Zheng, Yue [1 ]
Fang, Debin [2 ]
Wan, Zhongping [3 ,4 ]
机构：
[1] Huaibei Normal Univ, Sch Management, Huaibei, Peoples R China
[2] Wuhan Univ, Econ & Management Sch, Wuhan 430072, Peoples R China
[3] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
[4] Wuhan Univ, Computat Sci Hubei Key Lab, Wuhan 430072, Peoples R China
来源：
OPTIMIZATION | 2016年 / 65卷 / 07期
基金：
中国国家自然科学基金;
关键词：
Bilevel programming; pessimistic solution; Kth-Best algorithm; EXISTENCE; OPTIMIZATION;
D O I：
10.1080/02331934.2016.1154553
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we study the weak linear bilevel programming problems. For such problems, under some conditions, we first conclude that there exists a solution which is a vertex of the constraint region. Based on the classical Kth-Best algorithm, we then present a solution approach. Finally, an illustrative example shows that the proposed approach is feasible.
引用
收藏
页码：1437 / 1449
页数：13
相关论文
共 50 条
12345