Is the following 0-1 Knapsack problem solvable:

* 'float' positive values and
* 'float' weights (can be positive or negative)
* 'float' capacity of the knapsack > 0

I have on average < 10 items, so I'm thinking of using a brute force implementation. However, I was wondering if there is a better way of doing it.