The region of feasible solution of a linear programming problem has a ______ property in geometry, provided the feasible solution of the problem exists.

Explanation

Each constraint is satisfied by the points of a closed half space of Rⁿ, and the set of feasible solutions is the intersection of all these half spaces, which is a convex polyhedron. So the feasible region has the convexity property. The answer is (b).