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

一般的分数匹配多面体是半整数，所以存在与{ 0边标签的最佳解决方案，1 / 2，1 }。

The general fractional matching polytope is half-integral, so there exists an optimal solution with edge labels in {0, 1/2, 1}.

youdao