A knapsack problem is so named because the objective is to find the number of N items,each of which has a different weight and value,that can be placed in a knapsack with limited weight capacity so as to maximize the total value of the items placed in the knapsack.