The feasible region for an LPP is always a _________ polygon.
The feasible region is the common region determined by all the constraints including non-negative constraints of an LPP is called a feasible region for the given problem. A feasible solution is any point within or inside the boundary. Optimal solutions i.e. either maximum or minimum values occur at the corner points of the feasible region. Feasible region for an LPP is always a convex polygon.
