Is knapsack a Linear Programming problem?
The knapsack problem can be modelled as a mixed integer program (MIP) and the linear-programming relaxation of this model can be solved. The linear relaxation does not give a solution to the problem, but it will provide an upper bound to the solution of the knapsack problem (equivalent to a solution of the MIP) which helps the MIP solver in its quest to find the optimal integer solution.