Algorithms for sensitivity analysis of the knapsack problem are presented Exact sensitivity limits can be found by solving a single knapsack problem per item. Upper bounds can be used to find approximate sensitivity limits very fast Exact and approximate algorithms are compared with respect to time and quality.