title: Variation on knapsack - minimum total value exceeding 'W'
body: <p>Given the usual <code>n</code> sets of items (each unlimited, say), with weights and values:</p>
  
  <pre><code>w1, v1
  w2, v2
  ...
  wn, vn
  </code></pre>
  
  <p>and a target weight <code>W</code>, I need to choose items such that the total
  weight is <strong>at least</strong> <code>W</code> and the total value is <strong>minimized</strong>.</p>
  
  <p>This looks to me like a variation (or in some sense converse) of the
  integer/unbounded knapsack problem.  Any help in formulating the DP algorithm
  would be much appreciated!</p>