classical knapsack problem

Instead of searching an optimal solution in increasing order of bag size,why can’t we try every possible
item combination and pick the one which best matches our constraints?

In most cases, it will give Time Limit Exceeded verdict, because trying every combination of let’s say, N items, there are 2^N possible combinations. This may work for N<15, but after that, dynamic programming is the only option.