IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v92y2025i4d10.1007_s10898-025-01488-3.html
   My bibliography  Save this article

An exact approach for the Stackelberg knapsack problem with weight selection

Author

Listed:
  • Yeonghun Lee

    (Korea Advanced Institute of Science and Technology)

  • Kiho Seo

    (Samsung Electronics)

  • Seulgi Joung

    (Ajou University)

  • Sungsoo Park

    (Korea Advanced Institute of Science and Technology)

Abstract

The Stackelberg knapsack game with weight selection (SKPW) is a variation of the bilevel knapsack problem in which the leader must determine the weights of a given subset of items, and then, the follower solves the knapsack problem to maximize the profit sum. The leader’s objective is to maximize the sum of the weights of the leader’s items included in the follower’s knapsack solution. In this paper, we present an exact algorithm to solve SKPW for the first time in the literature. We establish a strict linear inequality system with an exponential number of constraints, whose feasibility can be utilized to find an optimal solution for SKPW. To address the challenge posed by the strict inequalities more effectively, we propose a linear program with exponentially many constraints. We report computational results on several randomly generated instances and compare the solutions derived from the proposed exact algorithm with those obtained using heuristic algorithms.

Suggested Citation

  • Yeonghun Lee & Kiho Seo & Seulgi Joung & Sungsoo Park, 2025. "An exact approach for the Stackelberg knapsack problem with weight selection," Journal of Global Optimization, Springer, vol. 92(4), pages 973-991, August.
    • Handle: RePEc:spr:jglopt:v:92:y:2025:i:4:d:10.1007_s10898-025-01488-3
    DOI: 10.1007/s10898-025-01488-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-025-01488-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-025-01488-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:92:y:2025:i:4:d:10.1007_s10898-025-01488-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.