A technique for finding MINSUM and MINMAX solutions to multi-criteria decision problems, called Multi Objective Dynamic Programming, capable of handling a wide range of linear, nonlinear, ...

A condition is derived that must be satisfied by a continuous function h: X → X in order to be the optimal policy function of a strictly concave deterministic dynamic programming problem which is ...