Showing 1 - 3 of 3
Persistent link: https://www.econbiz.de/10014231717
In this paper, we study the sensitivity of the optimum of a max-min combinatorial optimization problem, namely the Knapsack Sharing Problem (KSP), to the perturbation of the profit of an arbitrary item. We mainly establish the interval limits of each perturbed item by applying a reduction of the...
Persistent link: https://www.econbiz.de/10005670868
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...
Persistent link: https://www.econbiz.de/10005670870