Sensitivity analysis of the optimum solution to perturbations of the profit of an item in the multiple-choice knapsack problem

Luay Aljasim and Ferhan Al-Maliky

International Journal of Mathematics in Operational Research, 2024, vol. 28, issue 2, 147-162

Abstract: Sensitivity analysis of an optimisation problem is the task of studying the stability of a given optimal solution due to the modifications in the parameters data. In this paper, we study the sensitivity analysis for the optimum to the multiple-choice knapsack problem (MCKP), according to the perturbation of the profit of an arbitrary item. We study how much the profit of an arbitrary item in the original problem can vary without changing the optimal solution structure. The range of variations can be represented by the so-called sensitivity intervals that consist of lower and upper values (limits). The obtained results are explained through a simple example. Furthermore, the performance of the proposed methods is evaluated on a set of problem instances.

Keywords: knapsack; multiple choice; optimality; optimisation; perturbation; sensitivity analysis. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=138902 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:28:y:2024:i:2:p:147-162

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().