Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

In this paper, we study the sensitivity of the optimum of the binary knapsack problem to perturbations of the profit of a subset of items. In order to stabilize the optimal solution, two cases are distinguished. The first case represents a subset of items whose perturbation can be done individually. The second case represents a subset of items where perturbing the profit of each item requires the perturbation of the profit of the other items. We will study the impact of the results obtained on an instance of the binary knapsack problem while considering the various cases. (c) 2008 Elsevier B.V. All rights reserved.