Question

The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

• A. Feasible region
• B. Objective function
• C. Decision region
• D. Optimal solution

Answer 1

The correct option is A Feasible region

This question is based on the definition of feasible region. Let us take one example and try to understand feasible region using that.

Let the constraints for a linear problem be

x + y ≤ 4
x ≥ 0 and y ≥ 0

The region common to all these three regions are the shaded part in the figure given below

If we take any point from the shaded region, it will satisfy all the three inequalities or constraints. We call this shaded region the feasible region for this linear programming problem