并提出了求最优解的搜索算法。
Finally the searching algorithm of optimal solution is presented.
最后应用枚举法，得到全局最优解。
Lastly the global optimized solution can be got by enumerating.
讨论了该模型的动态决策过程和最优解的性质。
The dynamic decision process of that model and the characters of its optimal solutions were discussed.
所以，可以用定量技术得到一个精确的最优解。
So, we can get an accurate optimum solution with quantitative technology.
一个问题的最优解能够用原始问题的子问题的最优解构造得到。
An optimal solution to the problem could be constructed from optimal solutions to subproblems of the original problem.
给出了一类整数规划问题有唯一最优解的充要条件。
The number of the most optimal solutions of this integer programming is determined.
由于计划调度问题本身的复杂性，很难寻求到最优解。
It is very difficult for solving the planning and scheduling problem because of its complexity.
由于混沌具有遍历性，TSP问题总是能够达到最优解。
Due to chaotic ergodicity, TSP can always achieve optimal path.
通过算法的搜索、加速，可以自行找到所求问题的最优解。
It can find the optimal solutions to the problem by itself through the search and acceleration.
这类问题不存在一般意义的最优解，更不存在唯一的最优解。
There is no optimal solution to those problems, lest unique solutions.
多峰值函数优化结果表明，该算法能更有效地达到全局最优解。
The optimization result of multi-peak value function shows that the algorithm introduced can converge to the globally optimal solution effectively.
其最优解为库存应用中需求率曲线的拟合提供更多的选择方式。
The optimization solution provides more choices to the imitating of demand rate curve of inventory applications.
进化规划(EP)是一种随机优化技术，它可以发现全局最优解。
Evolutionary Programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems.
并根据主轴的实际情况，选择合适的寻优方法，进而确定最优解。
According to the conditions of main shaft, choosing appropriate method to decide the best solution.
标准遗传算法在解决旅行商问题时效率不高，容易陷于局部最优解。
Traditional genetic algorithms have low efficiency and tend to be trapped by local optimizations.
解法能在很短时间内给出N数码的一个解，不过这个解通常不是最优解。
This method almost immediately gives a solution to N-puzzle problem, however it is usually not the optimal one.
实验结果表明，该算法能够保证求得全局最优解，并且寻优速度有很大提高。
The experiment shows the algorithm can surely and rapidly get global optimum solution and greatly improve con vergence rate.
文中还用这种新方法来确定机构的平衡重，并用SUMT外点法求出了最优解。
An example of determining the balance weight for a mechanism and the optimal solution by SUMT are given.
求出使最优解或最优基保持最优的消耗系数矩阵中列向量和行向量的可变范围。
The variable ranges of vectors in consumption coefficient matrix for which the optimal solution or optimal basis remain invariable are determined.
模拟实验表明此方法能比较快速的找到最优解，且具有良好的稳定性和收敛性。
Imitate experiment expresses this method can find out the superior solution quickly, and have a good stability and the astringency.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
因此存在一个包含最大空隙的最优解，而且每步总有一个包含了当前状态的最优解。
Thus, there exists an optimal answer which contains the large gap, so at each step, there is always an optimal answer which is a superset of the current state.
结果表明，该方法不要求预先假定接近最优解的初始参数值，且比传统优化方法有效。
The result shows that it does not demand to presuppose the initial parameters near optimal solution and it is more efficiency than the conventional optimization method.
多峰值函数优化结果表明，该算法可以有效地解决早熟收敛问题，更易达到全局最优解。
The optimization result of multi-peak value function shows that the algorithm presented can solve premature convergence problem effectively and converge to the globally optimal solution.
通过把单目标最优解模糊化，将双目标模糊优化问题转化为单目标极小化极大问题求解；
The problem of fuzzy optimization of two objectives is transformed into single objective problem by means of the fuzziness of optimum solutions of single objective.
通过把单目标最优解模糊化，将双目标模糊优化问题转化为单目标极小化极大问题求解；
The problem of fuzzy optimization of two objectives is transformed into single objective problem by means of the fuzziness of optimum solutions of single objective.
应用推荐