unbounded knapsack problem:

Recall: unbounded knapsack problem

• The unbounded knapsack problem:

http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/knapsack2.html

Problem:

Pack as many items into the knapsack such that the total value of the items packed is maximized     Note: you cannot exceed the capacity of the knapsack !