title: DP algorithm for bounded Knapsack?
body: <p>The <a href="http://en.wikipedia.org/wiki/Knapsack_problem" rel="noreferrer">Wikipedia article</a> about Knapsack problem contains lists three kinds of it:</p>
  
  <ol>
  <li><p>1-0 (one item of a type)</p></li>
  <li><p>Bounded (several items of a type)</p></li>
  <li><p>Unbounded (unlimited number of items of a type)</p></li>
  </ol>
  
  <p>The article contains DP approaches for 1. and 3. types of problem, but no solution for 2.</p>
  
  <p>How can the dynamic programming algorithm for solving 2. be described?</p>