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

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

youdao

这意味着可行域是由这个空间中的一些离散点构成的，因此放松某个限制可能会在新的多面体中获得更好的解决方案，也可能并不能获得更好的解决方案。

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.

youdao

换而言之，可行域不是一个多面体；它是由这个多面体或放松限制问题的实际多面体边界中的一些整数(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.

youdao