Journal of Samara State Technical University, Ser. Physical and Mathematical SciencesJournal of Samara State Technical University, Ser. Physical and Mathematical Sciences1991-86152310-7081Samara State Technical University20908Short CommunicationOn the algorithms of dynamic programming for optimal processesOvchinnikovValeriy GSenior Lecturer, Dept. of Oil and Gas Fields Developmentovchinnikov42@mail.ruSamara State Technical University1509201216321521818022020Copyright © 2012, Samara State Technical University2012The problem of discrete optimal control which has m consistently applied objective functions is formulated. In this problem the optimal process, also called m-optimal, is sought as a pair of functions defined on a finite set of steps at the links by which one function is uniquely defines the other, with the constraints of these functions with inclusion “∈” of their values in the final multiple values of the functions of the known pair. A uniform representation of sets, forming the k-optimal processes for k not greater than m, is given with construction of nondecreasing sequence, upper limited by this pair by the “⊂” inclusions, on the basis of characterization of solvability of the problem.discrete optimal controlconsistently applied criteriadynamic programmingalgorithmsдискретное оптимальное управлениепоследовательно применяемые критериидинамическое программированиеалгоритмы[Хачатуров В. Р., Веселовский В. Е., Злотов А. В., Калдябаев С. У., Калиев Е. Ж., Коваленко А. Г., Монтлевич В. М., Сигал И. Х., Хачатуров Р. В. Комбинаторные методы и алгоритмы решения задач дискретной оптимизации большой размерности. М.: Наука, 2000. 353 с.][Овчинников В. Г. Алгоритмы динамического программирования оптимальных и близких к ним процессов / В сб.: Труды пятой Всероссийской научной конференции с международным участием (29–31 мая 2008 г.). Часть 4: Информационные технологии в математическом моделировании / Матем. моделирование и краев. задачи. Самара: СамГТУ, 2008. С. 107–112.]