title: Algorithm to determine best combinations - Bin Packing
body: <p>Given a set of items, each with a value, determine the number of each item to include in a collection so that the total value is less than or equal to given limit and the total value is as large as possible. </p>
  
  <p>Example:</p>
  
  <pre>
  Product A = 4
  Product B = 3
  Product C = 2
  Product D = 5
  
  If Total Capacity = 10.5 , then the combination of B,C,D will be selected.
  If Total Capacity = 12.5 , then the combination of A,B,D will be selected.
  If Total Capacity = 17 , then the combination of A,B,C,D will be selected.
  </pre>
  
  <p>I am looking for an algorithm (like knapsack or bin packing) to determine the combination. Any help appreciated.</p>