Solution of dynamic programming problems by network methods

Chaadaev K. V.

The possibility of increasing the efficiency of the application of the dynamic programming method by transforming discrete optimization problems into network models is considered. The development of the corresponding algorithm and its software implementation in relation to the solution of multicriteria problems. The developed algorithm and the corresponding machine program can serve as a universal basis for constructing any algorithms and programs for solving discrete dynamic programming problems.

Keywords:algorithm, computational complexity, decomposition, discrete optimization, dynamic programming, exact methods, network model.