IDEAS home Printed from https://ideas.repec.org/p/mse/cesdoc/b07063.html
   My bibliography  Save this paper

Sensitivity analysis of the knapsack sharing problem: perturbation of the weight

Author

Listed:
  • Tarik Belgacem

    (Centre d'Economie de la Sorbonne)

  • Mhand Hifi

    (LaRIA et Centre d'Economie de la Sorbonne)

Abstract

In this paper, we study the sensitivity analysis of the optimum of the knapsack sharing problem (KSP) to the perturbation of the weight of an arbitrary item. We determine the interval limits of the weight of each perturbed item using a heuristic approach which reduces the original problem to a series of single knapsackk problems. A perturbed item belongs either to an optimal class, or to a non-optimal class. We evaluate the performance of the proposed heuristic on a set problem instances of the literature. Encouraging results are obtained

Suggested Citation

  • Tarik Belgacem & Mhand Hifi, 2007. "Sensitivity analysis of the knapsack sharing problem: perturbation of the weight," Documents de travail du Centre d'Economie de la Sorbonne b07063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    • Handle: RePEc:mse:cesdoc:b07063
    DOI: 10.1016/j.cor.2006.02.025
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00188333
    Download Restriction: no
    File URL: https://doi.org/10.1016/j.cor.2006.02.025
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.cor.2006.02.025?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
    ---><---

    More about this item

    Keywords

    Stability; knapsack sharing problem; combinatorial optimization; knapsack problem;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    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:mse:cesdoc:b07063. 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: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/cenp1fr.html .

    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.