| 1. | If the feasible region was empty , the interval vector could be excluded
若可行域为空，则可排除该区间向量。 |
| 2. | A method of modifier algorithm of constrained complex method in concave feasible fields
约束复合形法在非凸可行域上的一种修正算法 |
| 3. | Genetic algorithm applied to structural optimization problems with disjointed feasible domains
遗传算法求解可行域分离的结构优化问题 |
| 4. | Without any superstructures of distillation system , the feasible region could be looked for automatically
在不必给定精馏系统超结构的情况下，能够完成可行域的自动搜寻。 |
| 5. | The feasible area for this kind of programming changes into boundary , and there is no interior point
当规划问题为混合约束（带有等式约束）时，可行域变成一个边界区域，并没有内点。 |
| 6. | We defined the new quasi - cone condition , established the homotopy equation and proved the global convergence of this homotopy method
通过对可行域定义新的拟锥条件，给出相应同伦方程，并证明此同伦算法在此拟锥条件下具有全局收效性。 |
| 7. | In contrast to the similar robust model predictive control approach , the feasible domain of optimization can be remarkably enlarged with the application of set invariance theory
与同类方法相比，鲁棒不变集理论的应用能够显著扩大鲁棒预测控制的状态可行域。 |
| 8. | We use a scaling matrix which make the algorithm generate sequences of point in trust region and the interior of the feasible set . because of the boundedness of the trust region , trust region algorithm can use non - convex approximate models
构造合理的仿射变换矩阵，在投影空间构造信赖域子问题，产生迭代方向，使迭代点既保持在信赖域内，又是严格可行域的内点。 |
| 9. | Continuing above curse , then we can get its optimum solution , that is to say , starting from some feasible vertex , we will get the optimum solution of some linear programming problem after finite times transition of vertex along edge of feasible region
继续上述过程，就能求得线性规划问题的最优解。这就是说，自可行域的某顶点出发，沿可行域的棱经过若干次可行域顶点的转移后，就能得到线性规划问题的最优解(在最优解存在的情况下) 。 |
| 10. | Secondly , the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set , while the parameters are bounded if the solution set of constrained optimization is nonempty , which is available for numerical computation
另外在很多情况下，罚函数法中的罚因子当迭代点接近可行域边界时趋于无穷大，而参数控制算法中，只要约束优化问题有最优解，则参数是有界的，这对数值计算是有利的。 |
