In an optimisation problem, there are typically a number of constraints on the variables. For example, a problem might be to find the maximum possible value of \(2x+3y\) subject to the constraints
\[\begin{align*}
x&\ge0\\
y&\ge0\\
x+y&\le10\\
y&\ge x-2.
\end{align*}\]
The feasible region for a problem such as this is the set of all possible values of the variables which satisfy the constraints. Any solution to the problem must lie within this set.
For the above example, the constraints are shown in this graph with the excluded regions shaded; the feasible region then remains as the unshaded region.
