Given that we have a set of items :- { (c1, w1) , (c2, w2), (c3, w3) , ... } where (ci, wi) are the respective cost and weight of the ith item. Its required to minimize total cost of items C such that total weight of the items always sums up to value 'W' (non-negative integer) and total number of items cannot exceed 'n'.
How to minimize cost of group of items given that weights of item sums up to fixed value and atmost 'n' number of items are allowed?
0
$\begingroup$
combinatorics
optimization
integer-programming
-
0Knapsack problem ideas may help http://en.wikipedia.org/wiki/Knapsack_problem – 2012-08-08