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 条
  • [41] IMAGE SPACE BRANCH-AND-BOUND ALGORITHM FOR GLOBALLY SOLVING MINIMAX LINEAR FRACTIONAL PROGRAMMING PROBLEM
    Jiao, Hongwei
    Ma, Junqiao
    Shang, Youlin
    PACIFIC JOURNAL OF OPTIMIZATION, 2022, 18 (01): : 195 - 212
  • [42] A linear multivariate decision tree with branch-and-bound components
    Engur, Enver
    Soylu, Banu
    NEUROCOMPUTING, 2024, 576
  • [43] An effective branch-and-bound algorithm for convex quadratic integer programming
    Christoph Buchheim
    Alberto Caprara
    Andrea Lodi
    Mathematical Programming, 2012, 135 : 369 - 395
  • [44] Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming
    Sven Leyffer
    Computational Optimization and Applications, 2001, 18 : 295 - 309
  • [45] Integrating SQP and branch-and-bound for mixed integer nonlinear programming
    Leyffer, S
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 18 (03) : 295 - 309
  • [46] Enhancing Branch-and-Bound for Multiobjective 0-1 Programming
    Forget, Nicolas
    Parragh, Sophie N.
    INFORMS JOURNAL ON COMPUTING, 2024, 36 (01) : 285 - 304
  • [47] An effective branch-and-bound algorithm for convex quadratic integer programming
    Buchheim, Christoph
    Caprara, Alberto
    Lodi, Andrea
    MATHEMATICAL PROGRAMMING, 2012, 135 (1-2) : 369 - 395
  • [48] A total unimodularity based branch-and-bound method for integer programming
    Wang, Jun
    Long, Mei
    Li, Duan
    2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 642 - +
  • [49] An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
    Buchheim, Christoph
    Caprara, Alberto
    Lodi, Andrea
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6080 : 285 - +
  • [50] Reservation table scheduling: Branch-and-bound based optimization vs. integer linear programming techniques
    Cherroun, Hadda
    Darte, Alain
    Feautrier, Paul
    RAIRO-OPERATIONS RESEARCH, 2007, 41 (04) : 427 - 454
12345