NEW BRANCH-AND-BOUND RULES FOR LINEAR BILEVEL PROGRAMMING

被引：474
|
作者：
HANSEN, P
JAUMARD, B
SAVARD, G
机构：
[1] ECOLE POLYTECH,MONTREAL H3C 3A7,QUEBEC,CANADA
[2] GRP ETUD RECH ANAL DECIS,MONTREAL H3C 3A7,QUEBEC,CANADA
[3] COLL MIL ROYAL ST JEAN,ST JEAN J0J 1R0,QUEBEC,CANADA
来源：
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING | 1992年 / 13卷 / 05期
关键词：
BILEVEL PROGRAMMING; STACKELBERG GAME; VARIABLE ELIMINATION; BRANCH AND BOUND;
D O I：
10.1137/0913069
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms of tightness of the follower's constraints are used to fathom or simplify subproblems, branch and obtain penalties similar to those used in mixed-integer programming. Computational results are reported and compare favorably to those of previous methods. Problems with up to 150 constraints, 250 variables controlled by the leader, and 150 variables controlled by the follower have been solved.
引用
收藏
页码：1194 / 1217
页数：24
相关论文
共 50 条
  • [1] An extended Branch-and-Bound algorithm for fuzzy linear bilevel programming
    Zhang, Guangquan
    Lu, Jie
    Dillon, Tharam
    APPLIED ARTIFICIAL INTELLIGENCE, 2006, : 291 - +
  • [2] An enhanced branch-and-bound algorithm for bilevel integer linear programming
    Liu, Shaonan
    Wang, Mingzheng
    Kong, Nan
    Hu, Xiangpei
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (02) : 661 - 679
  • [3] An extended branch and bound algorithm for linear bilevel programming
    Shi, Chenggen
    Lu, Jie
    Zhang, Guangquan
    Zhou, Hong
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (02) : 529 - 537
  • [4] A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming
    Takahito Kuno
    Computational Optimization and Applications, 2001, 20 : 119 - 135
  • [5] A finite branch-and-bound algorithm for linear multiplicative programming
    Kuno, T
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 20 (02) : 119 - 135
  • [6] AND/OR branch-and-bound for solving mixed integer linear programming problems
    Marinescu, R
    Dechter, R
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 857 - 857
  • [7] Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
    Adelgren, Nathan
    Gupte, Akshay
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (02) : 909 - 933
  • [8] AN IMPLICIT BRANCH-AND-BOUND ALGORITHM FOR MIXED-INTEGER-LINEAR PROGRAMMING
    LIN, YL
    AUSTIN, LM
    BURNS, JR
    COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (05) : 457 - 464
  • [9] A method to improve integer linear programming problem with branch-and-bound procedure
    Chan, Din-Yuen
    Ku, Cheng-Yuan
    Li, Ming-Chai
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 179 (02) : 484 - 493
  • [10] A novel branch-and-bound algorithm for solving linear multiplicative programming problems
    Hu, Peng
    Gu, Hengyang
    Wang, Bowen
    OPTIMAL CONTROL APPLICATIONS & METHODS, 2024, 45 (06): : 2636 - 2650
12345