The common region determined by all the constraints of a linear programming problem is called : (A) an unbounded region (B) an optimal region (C) a bounded region (D) a feasible region