Thank you Martin

Dynamic programming solution
Unbounded knapsack problem
If all weights (w1,...,Wn,W) are nonnegative integers, the knapsack problem
can be solved in pseudo-polynomial time using dynamic programming. The
following describes a dynamic programming solution for the unbounded
knapsack problem.

The Knapsack/Rucksack problem is exactly what I am looking for, and I
suppose my next biggest problem is to find an equivelant VB formula to make
it come to life...

Appreciate the pointer

Mick