Dynamic programming with Pareto sets
Valery I. Struchenkov · Journal of Applied and Industrial Mathematics · 2010
Under study is the problem of optimal allocation of a resource, and a dynamic programming scheme is proposed for its solution. Instead of the recurrent equations, the stepwise computation of the Pareto-optimal points is used on the plane of values of the target function and resource. Some examples demonstrate the efficiency of this approach.