feasible region

Both varieties have short enough maturities to make production feasible in many U.S. growing regions.

The space of all candidate solutions is called the feasible region, feasible set, search space, or solution space.

Alternatively, the denominator of the objective function has to be strictly negative in the entire feasible region.

The possible results of Phase I are either a basic feasible solution is found or that the feasible region is empty.

This implies that the feasible region for the original problem is empty, and so the original problem has no solution.

Branch to partition the problem into new problems with restricted feasible regions.

This will certainly be the case if the constraints of VMP define a bounded feasible region.

Nevertheless, there are some cases where it is easy to recognise that the feasible region is bounded.

Contrary to the simplex method, it reaches an optimal solution by traversing the interior of the feasible region.

Geometrically, the linear constraints define the feasible region, which is a convex polyhedron.