The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
All points were arranged according to the fitness value in each iterative step of the algorithm, and the good points and the bad points were made pairs respectively.
该算法在迭代的每一步，都将全部点根据适应值进行排序，让好点与差点进行两两配对。
Newton Raphson method was introduced into the FEM analysis model in order to ensure that the solution of each iterative step would converge by means of satisfying some restrictive condition.
在有限元分析模型中引入了牛顿迭代法，以使每一时间步长的末端温度满足某一限制条件而平衡收敛。
应用推荐