Among the mathematical methods used in economics, a prominent place is occupied by the dynamic programming method, with the help of which the optimal control of multi-stage processes is organized. The disadvantage of this method is the impossibility of calculating all solutions to the problem if their criteria-based estimates coincide. The fact of the existence of several optimal trajectories of a multi-step process may mean that the task is not set correctly, in the sense that the assigned criteria do not fully characterize the system under study. This means that the traditional method of dynamic programming needs to be refined in case of the existence of several optimal trajectories with the same value of the criterion. This article proposes the most general version of such refinement, namely, a multi-criteria numerical scheme is generalized. For a more visual representation of calculations and the result of the study, we will describe the discrete dynamic programming problem in terms of graph theory. In this case, it reduces to the problem of finding the optimal path on a directed graph. To solve it, a three-stage algorithm is proposed, the composition of which includes the following steps. The first stage is the construction of optimal criteria estimates for paths from the initial vertex to all the others. To perform this stage, the most universal method is the multicriteria version of the Ford – Bellman method. The second stage is the construction of a graph of optimal paths. In the original graph, arcs are selected that are part of the optimal paths. Of these, using the original algorithm, a subgraph is formed in which all paths are optimal. It is analytically proved that this algorithm gives the correct result (correct). The third stage is enumeration of all paths in the constructed subgraph. Numerical experiments showed that the proposed three-stage method works efficiently on oriented graphs of any type in a sufficiently large range of dimensions. The proposed algorithm with minimal changes can be used to solve an arbitrary discrete dynamic programming problem.
Search for all solutions to the dynamic programming problem if their multicriteria estimates coincide
