An algorithm for generating efficient solutions of multiobjective dynamic programming problems

Dynamic programming and optimal control for vector-valued functions: A state-of-the-art review

“…In this section we will present different MODP models in discrete time. In [2,3] the authors proposed to solve the following formulation:…”

“…We note that, for each fixed , at least one optimal solution of the problem P ( ) is an efficient solution of the defined problem. To generate the entire set of efficient solutions, in [3] the authors decomposed the parametric space by using the constrained approach. Moreover, if the proposed formulation is separable and the separation is monotone, the problem P ( ) can be decomposed into sub-problems by DP in the sense of [40].…”

Enhancing Decomposition Approach for Solving Multi-Objective Dynamic Non-Linear Programming Problems Involving Fuzziness

“…One of the most essential methodologies for solving optimization problems is dynamic programming (DP), where the so-called principle of optimality, as defined by Bellman [1] is used to create its methods. The multi-objective dynamic programming (MODP) is a method for resolving problems with competing objective functions that follows the DP properties (Mine and Fukushima [2]; Carraway et al [3]; Abo-Sinna and Hussein [4]; Abo-Sinna and Hussein [5]).…”