A. Feasible region
B. Infeasible region
C. Unbounded solution
D. None of the above
✅ The correct answer is option A.
While solving a LP model graphically, the area bounded by the constraints is called feasible region. It is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem’s constraints, potentially including inequalities, equalities, and integer constraints.
While solving a LP model graphically, the area bounded by the constraints is called feasible region. It is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem’s constraints, potentially including inequalities, equalities, and integer constraints.