Why Knapsack problem is not a LP problem?

We know that LP can solve optimization problems that gas linear constraints and linear objective functions. Knapsack problem can be formulated into a linear objective function (because it is just a summation of Pi*Xi) and linear constraints (because it is just a summation of the items weights which should be <= the knapsack weight), so why we can’t consider it an LP problem?