UPSEE Solved Model Paper 4

A bounded feasible region will have both a maximum value and a minimum value for the objective function. It is bounded if it can be enclosed in any shape. A convex polygon is a simple not self-intersecting closed shape in which no line segment between two points on the boundary ever goes outside the polygon.
Hence, the answer is convex polygon.