“feasible region”簡單造句，feasible region造句子

The feasible region of integer problems is not a continuous region.

This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.

A problem with multiple solutions has more than one point in its feasible region that either maximize or minimize a problem.

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.

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.

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.