Besides, the constraint set cutting method of the method 1 can be used to solve the programming problems with concave constraint set.
方法1的约束域分割法还可用以求解约束为凹集时的规划问题。
The realization of the method is described, and the algorithm to construct the constraint set of expression LRAUC single-path testing is given.
阐述了此方法的具体实现，给出了表达式LRAUC单路测试约束集构造算法。
To solve the constraint multi-solution problem, the constraints are separated to two sets, the original constraint set and the additional constraint set.
针对几何约束求解的多解性问题，将约束分成两个集合：原约束集合和增加的额外约束集合。
The active constraint set was introduced in the nonlinear constraints of the optimization, meanwhile the project gradient method was used to treat the linear boundary constraints.
对于其中的非线性约束采用活动约束集的概念，而对于线性边界约束，则按约束优化方法中的梯度投影法作专门处理。
The description is based on constraints and called constraint model, which is defined by the features that satisfy a definite constraint set.
模型描述是基于约束的，故称为约束模型，并定义为满足一定约束关系集的特征集合。
The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
通过启发式搜索算法使增加的额外约束得到最大化满足，从而寻找到符合用户意图的解。
The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
通过启发式搜索算法使增加的额外约束得到最大化满足，从而寻找到符合用户意图的解。
应用推荐