V. I. Tsurkov U.S.S.R. Comput. Math. Math. Phys. , vol.21 No.4 , 01.1981 , p. 38-49, language: английский ISSN 0041-5553  Аннотация Decomposition for finding opimal solution for block-separable dynamic programming problems is proposed. The method is based on aggregation an disaggregation of controls. The optimality criterion for intermediate solutions is proved. The monotonicity of the iterative process with respect to the functional is deduced. The effectiveness of the method is illustrated by an example.  Ключевые слова decomposition; aggregation of controls; optimal solution; block-separable dynamic programming; disaggregation; optimality criteria for intermediate solutions