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 条
  • [31] Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
    M. Köppe
    M. Queyranne
    C. T. Ryan
    Journal of Optimization Theory and Applications, 2010, 146 : 137 - 150
  • [32] A mixed integer programming formulation for the L-maximin problem
    Sayin, S
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (03) : 371 - 375
  • [33] An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem
    Catanzaro, Daniele
    Engelbeen, Celine
    ALGORITHMS, 2015, 8 (04): : 999 - 1020
  • [34] New integer programming formulation for multiple traveling repairmen problem
    Onder, Gozde
    Kara, Imdat
    Derya, Tusan
    19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016), 2017, 22 : 355 - 361
  • [35] PARAMETRIC FORMULATION OF THE GENERAL INTEGER LINEAR-PROGRAMMING PROBLEM
    JOSEPH, A
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (09) : 883 - 892
  • [36] A new integer programming formulation of the graphical traveling salesman problem
    Carr, Robert
    Ravi, R.
    Simonetti, Neil
    MATHEMATICAL PROGRAMMING, 2023, 197 (02) : 877 - 902
  • [37] An integer programming formulation of the bid evaluation problem for coordinated tasks
    Collins, J
    Gini, M
    MATHEMATICS OF THE INTERNET: E-AUCTION AND MARKETS, 2002, 127 : 59 - 74
  • [38] A new integer programming formulation of the graphical traveling salesman problem
    Robert Carr
    R. Ravi
    Neil Simonetti
    Mathematical Programming, 2023, 197 : 877 - 902
  • [39] A new integer linear programming formulation for the problem of political districting
    Djordje Dugošija
    Aleksandar Savić
    Zoran Maksimović
    Annals of Operations Research, 2020, 288 : 247 - 263
  • [40] A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
    Carr, Robert D.
    Simonetti, Neil
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2021, 2021, 12707 : 458 - 472
12345