整型问题的可行域并不是一个连续区域。
The feasible region of integer problems is not a continuous region.
有限步迭代后，迭代点落入可行域。
After finite iterations, the iteration point always gets into the feasible set.
若可行域为空，则可排除该区间向量。
If the feasible region was empty, the interval vector can be excluded.
最佳解通常都是其可行域所构成的多面体的一个顶点。
Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.
本文实现了一种基于可行域的图案填充的方法。
This paper realize an approach to filling pattern based on feasible area.
要更好地理解此处讨论的问题，让我们来了解一下这个简单的可行域。
To understand better what is being discussed here, examine this simple feasible region.
电力系统潮流可行域是一种评估系统静态安全的有效手段。
Power flow feasibility region (PFFR) is one of the most promising frameworks for static security assessment of power systems.
在公共可行域内优化各个截面的转角，然后加权平均得到目标函数的最优值。
All cross section rotating Angle is optimized in the feasible zone, and the optimal value of target function is calculated.
计算结果表明该文提出的约束复合形法在非凸可行域上的修正算法是可行的。
The computation results show that the method of modifier algorithm of constrained complex method in concave feasible fields, proposed in this paper, is effective.
在公共可行域内优化各个截面的转角，然后加权平均可得到目标函数的最优值。
Optimizes turning Angle of various sections in the public feasible zone, and then obtains the optimal value of target functions by evaluating weighted mean.
因此，整型问题的约束放松并不一定会改进解决方案，因为可行域是离散的，而不是连续的。
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.
通过引入缩进因子，改进P SO算法，使粒子在迭代过程中保持在可行域内。
Guaranteed by the indentation factor, the improved PSO algorithm can keep the iteration particles in feasible region.
与惩罚函数法相比，可行基规则不需要额外的参数，且指引粒子迅速飞向可行域。
In contrast to the penalty function method, the rule requires no additional parameters and can guide the swarm to the feasible region quickly.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
由于多层复形法全部优化过程都是在可行域内进行，所以得出的优化结果必然满足约束条件。
Due to multilayer complex method of the whole optimization procedure at feasible zone, the optimization can meet the condition of constraint.
最后，我们讨论了整型问题的可行域的可视化问题，以及整型和相关放松限制问题的目标函数的处理方法。
Finally, I discussed feasible region visualization for an integer problem and the way it relates to the objective function for an integer and for the corresponding relaxed problem.
同时在分析现有多类分类机器不足的基础上，提出了一种基于可行域解析中心的多类分类器。
Then we review multi-class classifiers commonly adopted and propose a multi-class classifier based on analytical center of version space.
该模型分析了冲压件截面形状，确定所有截面转角的公共可行域，并建立一组目标函数作为优化对象。
The panel cross section is analyzed in the model, and the feasible zone of all cross section rotating angle is located, and a group of target function is proposed as optimized object.
根据冲压方向的确定原则，提出了一种通过编程由计算机自动确定汽车覆盖件冲压方向可行域的方法。
Based on the principle of determining the punching direction, a method to calculate the feasible zone of punching direction by programming has been proposed.
该算法模拟分形生长的过程，避免了对可行域的盲目分割，并指导新点以较大的概率产生于较优的区域。
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.
通过对可行域定义新的拟锥条件，给出相应同伦方程，并证明此同伦算法在此拟锥条件下具有全局收敛性。
We defined the new quasi-cone condition, established the homotopy equation and proved the global convergence of this homotopy method.
利用该模型对冲压件截面形状进行了分析，确定了截面转角的公共可行域，并建立了一组目标函数作为优化对象。
With the model, the cross sectional shape of a pressing is analyzed, and the public feasible zone of sectional angle is determined, and a group of target functions are created as optimization objects.
在容差分析、设计和参数中心设计中，一般需要对参数可行域进行近似，或是知道容差已知情况下的产品的合格率。
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.
运输问题存在“多反而少”现象，这是由于在松约束模型中放宽了约束条件，使得可行域变大，产生了新的最优解。
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.
换而言之，可行域不是一个多面体；它是由这个多面体或放松限制问题的实际多面体边界中的一些整数(x1、x 2、…、xn)对。
In other words, the feasible region is not a polyhedron; it's composed only of the integer (x1, x2,..., xn) pairs inside or at the boundaries of the actual polyhedron of the relaxed problem.
本文对现有的变分不等式问题的二次外梯度投影算法进行分析，并对可行域为球的二次外梯度投影算法的计算过程进行简化。
This paper makes an analysis of this quadratic outer gradient project algorithms and simplifies the process of the computation of projection needed in this method for the case of domain being a ball.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
剖面线填充是开发CAD系统时经常遇到的问题，该文提出了一种在VC环境下实现剖面线填充的方法——基于可行域的定向搜索方法。
The problem of filling area with se ct ion lines is often encountered during the development of CAD system. Accordingly a new method based on direct search using VC is introduced in this paper.
剖面线填充是开发CAD系统时经常遇到的问题，该文提出了一种在VC环境下实现剖面线填充的方法——基于可行域的定向搜索方法。
The problem of filling area with se ct ion lines is often encountered during the development of CAD system. Accordingly a new method based on direct search using VC is introduced in this paper.
应用推荐