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 条
  • [21] Solution algorithm for the bilevel linear programming formulation of the network design problem
    Zhao, MX
    Gao, ZY
    [J]. TRAFFIC AND TRANSPORTATION STUDIES, PROCEEDINGS, 2004, : 317 - 325
  • [22] A GENERAL BILEVEL LINEAR-PROGRAMMING FORMULATION OF THE NETWORK DESIGN PROBLEM
    BENAYED, O
    BOYCE, DE
    BLAIR, CE
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1988, 22 (04) : 311 - 318
  • [23] A faster algorithm for the continuous bilevel knapsack problem
    Fischer, Dennis
    Woeginger, Gerhard J.
    [J]. OPERATIONS RESEARCH LETTERS, 2020, 48 (06) : 784 - 786
  • [24] Improved approximation algorithms for a bilevel knapsack problem
    Qiu, Xian
    Kern, Walter
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 595 : 120 - 129
  • [25] Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
    Koeppe, M.
    Queyranne, M.
    Ryan, C. T.
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2010, 146 (01) : 137 - 150
  • [26] Uncertain bilevel knapsack problem and its solution
    Junjie Xue
    Ying Wang
    Jiyang Xiao
    [J]. Journal of Systems Engineering and Electronics, 2017, 28 (04) : 717 - 724
  • [27] A STUDY ON THE COMPUTATIONAL COMPLEXITY OF THE BILEVEL KNAPSACK PROBLEM
    Caprara, Alberto
    Carvalho, Margarida
    Lodi, Andrea
    Woeginger, Gerhard J.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2014, 24 (02) : 823 - 838
  • [28] Improved Approximation Algorithms for a Bilevel Knapsack Problem
    Qiu, Xian
    Kern, Walter
    [J]. COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 312 - 323
  • [29] Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
    M. Köppe
    M. Queyranne
    C. T. Ryan
    [J]. Journal of Optimization Theory and Applications, 2010, 146 : 137 - 150
  • [30] Uncertain bilevel knapsack problem and its solution
    Xue, Junjie
    Wang, Ying
    Xiao, Jiyang
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2017, 28 (04) : 717 - 724
12345