In the first feasible region above, the optimal solution is the right vertex of the solution space.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点。
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.
因此，整型问题的约束放松并不一定会改进解决方案，因为可行域是离散的，而不是连续的。
This means that the feasible region consists of discrete points in space and, therefore, a relaxation in one of the constraints may or may not yield a better solution inside the new polyhedron.
这意味着可行域是由这个空间中的一些离散点构成的，因此放松某个限制可能会在新的多面体中获得更好的解决方案，也可能并不能获得更好的解决方案。
Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.
最佳解通常都是其可行域所构成的多面体的一个顶点。
In the first feasible region above, the optimal solution is the right vertex of the solution space, which is a triangle made by all the constraints.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点，而这个解析空间是一个由所有约束构成的三角形。
Some properties of neural optimization are studied in this paper. The properties of the solutions and the region of attraction, the division of the feasible solution space are investigated.
本文研究了一类神经网络优化特性的一些问题。对其解的特性、可行解空间的划分及吸引区特性进行了研究。
The properties of the solutions and the region of attraction, the division of the feasible solution space are investigated.
对其解的特性、可行解空间的划分及吸引区特性进行了研究。
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.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
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.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
应用推荐