假定约束是可行、规范的，对于目标函数为正定或半正定的情形，得到了全局最优解的充要条件。
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.
应用推荐