BILEVEL LINEAR-PROGRAMMING

被引:117
作者
BENAYED, O
机构
[1] Faculté des Sciences Économiques et de Gestion de Sfax, Route de l'Aérodrome, P.O. Box 69
关键词
D O I
10.1016/0305-0548(93)90013-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper gives a review of the features of Bilevel Linear Programming (BLP) by presenting prior results as well as providing new results, including the capability of the problem to formulate any piecewise linear function and its connection to other optimization problems. The paper also surveys the applications and the algorithms of BLP; the NP-hardness of BLP did not prevent the success of several applications of the model to real world problems. Certain confusing representations in the literature are clarified.
引用
收藏
页码:485 / 501
页数:17
相关论文
共 69 条
[1]  
ALKHAYYAL FA, 1987, MATH PROGRAM STUD, V39, P1
[2]   A SOLUTION METHOD FOR THE LINEAR STATIC STACKELBERG PROBLEM USING PENALTY-FUNCTIONS [J].
ANANDALINGAM, G ;
WHITE, DJ .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (10) :1170-1173
[3]   MULTILEVEL PROGRAMMING AND CONFLICT-RESOLUTION [J].
ANANDALINGAM, G ;
APPREY, V .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (02) :233-247
[4]  
ANANDALINGAM G, 1985, IEEE P INT C CYBERN, P825
[5]  
[Anonymous], 1985, MATH MULTIOBJECTIVE, DOI DOI 10.1007/978-3-7091-2822-0_3
[6]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[7]   OPTIMALITY CONDITIONS FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
NAVAL RESEARCH LOGISTICS, 1984, 31 (01) :13-26
[8]   CONVEX 2-LEVEL OPTIMIZATION [J].
BARD, JF .
MATHEMATICAL PROGRAMMING, 1988, 40 (01) :15-27
[9]   AN EFFICIENT POINT ALGORITHM FOR A LINEAR 2-STAGE OPTIMIZATION PROBLEM [J].
BARD, JF .
OPERATIONS RESEARCH, 1983, 31 (04) :670-684
[10]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292