全部

1·The feasible region of integer problems is not a continuous region.

整型问题的可行域并不是一个连续区域。

2·If the feasible region was empty, the interval vector can be excluded.

若可行域为空，则可排除该区间向量。

3·So there are multiple points in the feasible region that yield the same value for the objective function.

因此在这个可行域中有多个点对于目标函数来说会产生相同的值。

4·Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.

最佳解通常都是其可行域所构成的多面体的一个顶点。

5·In contrast to the penalty function method, the rule requires no additional parameters and can guide the swarm to the feasible region quickly.

与惩罚函数法相比，可行基规则不需要额外的参数，且指引粒子迅速飞向可行域。

6·The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.

此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。

7·Thus, a relaxation of the constraint of an integer problem does not necessarily improve the solution, because the feasible region is discrete and not continuous.

因此，整型问题的约束放松并不一定会改进解决方案，因为可行域是离散的，而不是连续的。

8·In tolerance analysis, tolerance design or parameters design, it is required to approximate the feasible region of parameters, or to estimate the yield of product.

在容差分析、设计和参数中心设计中，一般需要对参数可行域进行近似，或是知道容差已知情况下的产品的合格率。

9·A robust design was developed to obtain an optimum value insensitive to variations on the variables within the feasible region by consideration of the uncertainties.

一个强大的设计开发，以获得最佳的价值的不确定性考虑的可行区域内的变量的变化不敏感。

10·The algorithm avoid segmenting the feasible region blind, and guide the candidate points being selected in the best area with a large probability by imitating fractal growth process.

该算法模拟分形生长的过程，避免了对可行域的盲目分割，并指导新点以较大的概率产生于较优的区域。