为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。
To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.
此时问题已转化为多个簇的单模态问题，在各个簇中再利用保收敛微粒群优化器获得每个簇的最优解。
So multimodal problem has turn into unimodal problem in some clusters in which the optimal solution is guaranteedly located through the guaranteed convergence particle swarm optimizer.
利用遗传算法求解数学模型，解决了最终优化目标可能存在多个局部最优解的问题，拓宽了模糊物理规划的应用范围。
Genetic Algorithms is used in solving the mathematical model, it can obtain the global optimum even if there exists local optimums, and enlarge the application range of Fuzzy Physical Programming.
介绍了多个效率矩阵的指派问题最优解的一般解法。
The general solution of the best answer to the assignment problem through more than one efficiency matrix.
由于遗传算法是在解空间的多个区域内进行搜索，能以较大的概率跳出局部最优，因此可找到整体最优解。
As the genetic algorithms method can be used to search in various regions of a solution space, and to jump out of partial optimization by a greater probability to achieve an overall optimization.
求出使最优解或最优基保持最优的模型参数可变范围，并讨论了多个参数同时发生变化的情况。
The variable ranges of the model parameters for which the optimal solution or optimal basis remain optimal are determined. The case when several parameters changing simultaneously is discussed.
多目标遗传优化算法的一个优点就是可在一次迭代计算中寻找到问题的多个非劣最优解。
One advantage of multi-objective genetic optimization algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run.
它以当前的情况作最优选择，通过多个局部最优解最终获得一个全局次最优解。
It offers optimal solution based on current circumstance and achieves a global suboptimal solution by several local optimal solutions.
利用对偶线性规划和对偶线性规划最优解互补松弛条件解决了含有多个变量和两个约束的线性规划的图解法求解问题。
This paper discusses a kind of method of constructing the dual linear program with the linear combination of the constraint conditions, and shows that the method is simple and uniform.
利用对偶线性规划和对偶线性规划最优解互补松弛条件解决了含有多个变量和两个约束的线性规划的图解法求解问题。
This paper discusses a kind of method of constructing the dual linear program with the linear combination of the constraint conditions, and shows that the method is simple and uniform.
应用推荐