The feasible region for an LPP is always a __________ polygon.

Toolbox:
• The common region determined by all the constraints including non-negative constraints $x,y\geq 0$ of a linear programming problem is called the feasible region.
Step 1:
The feasible region of a system of linear inequalities is said to be bounded if it can be enclosed within a circle.
The feasible region for an LPP is always a convex polygon.