“feasible region”造句，怎麼用feasible region造句

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

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

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.

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.

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

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.