The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...

This is a preview. Log in through your library . Abstract The paper solves the stochastic inverse optimal problem. Dynamic programming is used to transform the original problem into a differential ...