Abstract. We consider the Blair hypothesis on the computational complexity of the problem associated with the optimal solutions of the so-called adjacent knapsack problems. The hypothesis is proved for the generalized adjacent knapsack problems.

Keywords: complexity of sensitivity analysis, NP- (DP-)hard problem.