The Kth-best approach for linear bilevel multi-follower programming

被引:46
作者
Shi, CG [1 ]
Zhang, GQ [1 ]
Lu, J [1 ]
机构
[1] Univ Technol Sydney, Fac Informat Technol, Broadway, NSW 2007, Australia
关键词
bilevel decision-making; decision-making optimization; Kth-best approach; linear bilevel programming; multi-follower programming;
D O I
10.1007/s10898-004-7739-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and one follower are involved. This paper addresses linear bilevel multi-follower programming (BLMFP) problems in which there is no sharing information among followers. It explores the theoretical properties of linear BLMFP, extends the Kth-best approach for solving linear BLMFP problems and gives a computational test for this approach.
引用
收藏
页码:563 / 578
页数:16
相关论文
共 16 条
[1]  
AIYOSHI E, 1981, IEEE T SYST MAN CYB, V11, P444
[2]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[3]   AN INVESTIGATION OF THE LINEAR 3 LEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1984, 14 (05) :711-717
[4]  
Bard JF, 1998, Practical Bilevel Optimization: Algorithms and Applications
[5]  
BIALAS W, 1978, MULTILEVEL LINEAR PR
[6]  
Bialas W., 1980, A parametric complementarity pivot approach for two-level linear programming
[7]   2-LEVEL LINEAR-PROGRAMMING [J].
BIALAS, WF ;
KARWAN, MH .
MANAGEMENT SCIENCE, 1984, 30 (08) :1004-1020
[8]   A LINEAR 2-LEVEL PROGRAMMING PROBLEM [J].
CANDLER, W ;
TOWNSLEY, R .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :59-76
[9]   NEW BRANCH-AND-BOUND RULES FOR LINEAR BILEVEL PROGRAMMING [J].
HANSEN, P ;
JAUMARD, B ;
SAVARD, G .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1992, 13 (05) :1194-1217
[10]  
LU J, 2005, IN PRESS INFORMATION