The deterministic and stochastic versions of the resource allocation problem have already been discussed in the literature. The goal of this contribution is to formulate optimization models applicable to the problem of resource allocation under uncertainty, which signifies that profits resulting...

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...