Integer Programming Formulation of the Bilevel Knapsack Problem

被引：2
|
作者：
Mansi, R. [1 ]
Hanafi, S. [1 ]
Brotcorne, L. [1 ]
机构：
[1] Univ Valenciennes, LAMIH SIADE, Valenciennes, France
来源：
MATHEMATICAL MODELLING OF NATURAL PHENOMENA | 2010年 / 5卷 / 07期
关键词：
Bilevel programming; Knapsack problem; dynamic programming; branch-and-bound;
D O I：
10.1051/mmnp/20105719
中图分类号：
Q [生物科学];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that the integer program reformulation is equivalent to the BKP. Numerical results show the efficiency of our method compared with those obtained by the algorithm of Moore and Bard.
引用
收藏
页码：116 / 121
页数：6
相关论文
共 50 条
  • [41] A mixed integer linear programming formulation of the maximum betweenness problem
    Savic, Aleksandar
    Kratica, Jozef
    Milanovic, Marija
    Dugosija, Djordje
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) : 522 - 527
  • [42] An Integer Programming Formulation of the Minimum Common String Partition Problem
    Ferdous, S. M.
    Rahman, M. Sohel
    PLOS ONE, 2015, 10 (07):
  • [43] A new integer linear programming formulation for the problem of political districting
    Dugosija, Djordje
    Savic, Aleksandar
    Maksimovic, Zoran
    ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 247 - 263
  • [44] Mixed Integer Linear Programming Formulation for the Taxi Sharing Problem
    Ben-Smida, Houssem E.
    Krichen, Saoussen
    Chicano, Francisco
    Alba, Enrique
    SMART CITIES, SMART-CT 2016, 2016, 9704 : 106 - 117
  • [45] On the integer programming formulation for the relaxed restricted container relocation problem
    Jin, Bo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 281 (02) : 475 - 482
  • [46] Parallel algorithm for the integer knapsack problem
    Universidad de La Laguna, Tenerife, Spain
    Concurrency Pract Exper, 4 (251-260):
  • [47] A parallel algorithm for the integer knapsack problem
    Morales, D
    Roda, JL
    Rodriguez, C
    Almeida, F
    Garcia, F
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1996, 8 (04): : 251 - 260
  • [48] Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming
    Mamedov K.S.
    Mamedov K.K.
    Elchueva S.K.
    Automatic Control and Computer Sciences, 2015, 49 (4) : 231 - 238
  • [49] A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
    Hemmati, Mehdi
    Smith, J. Cole
    DISCRETE OPTIMIZATION, 2016, 20 : 105 - 134
  • [50] On the Quasiconcave Bilevel Programming Problem
    H. I. Calvete
    C. Galé
    Journal of Optimization Theory and Applications, 1998, 98 : 613 - 622
12345