假定约束是可行、规范的，对于目标函数为正定或半正定的情形，得到了全局最优解的充要条件。
Under the cases that the objective function is positive definite or positive semidefinite, the necessary and sufficient conditions to characterize global optimal solution are obtained.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
另外，该算法可有效避免陷入局部最优，也不要求提供初始可行解。
Otherwise, the hybrid algorithm can avoid trapping in local optimum and does not need initial feasible solution.
根据问题的最优性和可行性提出一新的区域删除准则以排除问题（P）的可行域中不存在全局最优解的部分，结合区域删除准则和分支定界理论给出新算法。
New region-deleting principles are proposed based on the optimality and feasibility of the problem so as to delete the subregion without containing the optimal solutions of the problem(P).
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
运输问题存在“多反而少”现象，这是由于在松约束模型中放宽了约束条件，使得可行域变大，产生了新的最优解。
The Transportation Problem exists"more-for-less"paradox, which because the loose-constrained model has broadened the restriction, enlarged the feasible area, and bring new optimal solution.
通过对各种均衡解的效率的比较，得到了所谓的可行的帕累托最优的价格策略集，即合同曲线。
After detailed comparisons and discussions, the so-called feasible Darete efficient set of pricing schemes contract curve is obtained.
采用基于动态信息素更新策略的改进蚁群优化算法，在保证优化目标的基础上，迅速收敛并得到最优解，从而提高调度系统的可行性，增强系统稳定性。
Secondly, the algorithm based on the dynamic pheromone updating ensures the quick convergence and the optimal solution, thus improving the feasibility and the stability of the schedule system.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
该方法可获得最优解，并简单可行，适用于大中型公交网络的优化。
The method will bring about the best advantage and it is easy to use. It is suitable for the large and medium scale transportation network.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
应用推荐