Feasible region

Imagine you are trying to solve a puzzle with many rules. These rules are called constraints. They tell you what is allowed and what is not. Every choice that follows every single rule is a candidate solution.

All these possible choices together make up a special space. In math, we call this the feasible region or the solution space. It is the starting area where we look for answers. Before we narrow down our choices, every point in this space is a candidate.

Finding a point that fits all the rules is called constraint satisfaction.

Sometimes these spaces have very clear limits. We call a space that is closed in on all sides a bounded feasible set.

In a bounded set, you cannot move forever in any direction. Other times, a space might be unbounded. This means it can keep going forever in certain directions. For example, if a rule says a number must be greater than zero, it can grow forever.

If the rules are impossible to follow, the space might be empty. This happens when the constraints fight each other. In that case, the problem is infeasible and has no solution.

Many math problems use a special kind of shape called a convex feasible set. A set is convex if you can draw a straight line between any two points inside it. That line will stay inside the space and never leave.

This is very helpful for people trying to solve hard math problems. If the shape is convex, it is often easier to find the best answer. In these problems, a local best answer is usually the best answer for the whole space. This is known as a global optimum. Convex shapes help make sure we do not get stuck in the wrong spot.

In a specific type of math called linear programming, these regions have unique shapes. These shapes are called convex polytopes. A polytope is a region where the boundaries are made of flat surfaces called hyperplanes.

The corners of these shapes are called vertices. When we have two variables, the feasible region might look like a simple polygon. If we have three variables, the shape becomes a three-dimensional polyhedron.

To find the best answer, mathematicians often use the simplex method. This method starts at one vertex and tests it to see if it is the best. If it is not, the method moves to an adjacent vertex to keep searching.

We use these ideas in many different parts of science and math. In computer science, search algorithms use these spaces to find answers. In calculus, people use tests to find candidate solutions. They might look for a maximum or a minimum value. Sometimes a candidate solution might be a saddle point or an inflection point.

These are spots where the math seems to pause before rising or falling again. Even in biology, genetic algorithms use candidate solutions to evolve a population. Whether it is shapes or numbers, the feasible region helps us organize our choices.