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 ...

The paper solves the stochastic inverse optimal problem. Dynamic programming is used to transform the original problem into a differential equation. Such an equation is well-defined (with probability ...