EN
The article presents an application of dynamic programming method for solving an optimal allotment problem. On the basis of the presented example, authors showed that the dynamic programming method founded on Bellman’s equation finds an optimal solution very quickly. Finding an optimal solution of any given problem using as few iterations as possible, is a very important problem in numerical calculation. The obtained results of optimization are compared with different methods.