dynamic optimization problems的意思|示意

Novel intelligent algorithms based on bionics become more and more popular for solving dynamic optimization problems in recent years.

新型的智能仿生算法在动态优化问题中的应用也逐渐增多。

Of the problems of optimal control, the most important two optimization methods are Pontryagin minimum(or called maximum) principle and Bellman dynamic programming.

在最优控制中，最重要的两种优化方法是庞特里亚金最小值（或称最大值） 原理和贝尔曼动态规划法。

The method solves the problems which caused by dynamic planning dealing with multiple constraints and large optimization problems, and improves the precision of evolution algorithm.

计算表明，该方法避免了动态规划等算法处理多约束、大型优化问题的困难，同时提高了进化算法的精度。

Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.

现在，当我们讨论， 动态编程中的最优化问题时，我想说有两件事需要注意。

This algorithm avoids the dynamic programming in sub optimization problems, and improves the efficiency of the on line computations. The simulation results show the effectiveness of the new algorithm.

该算法避免了在子问题的求解中使用效率较低的规划方法，提高了线计算的效率。

The single optimization method is not feasible and efficient at all time. For specific problems, several integrated strategies of dynamic optimization solutions are developed in this paper.

单一的优化方法用于不同情况下的化工动态优化问题未必可行有效，为此本文针对具体情况，提出了多种解法的集成策略。