Each point in this region
represents a feasible choice open to the dealer for investing in tables and chairs The
region, therefore, is called the feasible region for the problem Every point of this
region is called a feasible solution to the problem Thus, we have,
Feasible region The common region determined by all the constraints including
non-negative constraints x, y ≥ 0 of a linear programming problem is called the feasible
region (or solution region) for the problem