Abstract
Abstract In this paper, we study the sensitivity of the optimum of the single knapsack problem (KP) and the knapsack sharing problem (KSP) to perturbations of the weight of a subset of items. We try to establish lower and upper bounds limits when a dynamic programming is applied. First, we show how to stabilize an optimal solution of KP, by considering two cases. A first case in which all perturbations are negative or nonnegative. A second case – that is a general case – for which a set of the perturbed items is divided into two disjoints subsets: a subset containing the items with nonnegative perturbations and another subset composed of items with negative perturbations. Second and last, we show how we can adapt the results established for KP to the KSP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
