Graph all the constraints, the area that satisfy all the constraints is the feasible region.

First is that we equate all our solution then graph all the points after this locate the corner point then you can now see where the feasible region.

Locate the area of overlapping constraint inequalities that satisfies all constraints while maximizing the objective function to define the feasible region for maximization in linear programming. Inside of the corner point.