The region that contains all the feasible solutions of a linear programming problem is called a feasible region.
The region satisfies all the restriction imposed by the linear programming problem.
The feasible region is the common region that is determined by all the constraints including non-negative constraints, that is, , of Linear programming problem.
The region other than the feasible region is an infeasible region.
Thus, the region that contains all the feasible solutions of a linear programming problem is called a feasible region.