Question

The constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 gives an unbounded feasible region for the linear programming problem with the same constraints

• A. True
• B. False

Answer 1

The correct option is B False

When we try to solve a linear programming problem in the graphical method, each constraint represent some area in the graph. Area common to all the constraints is called feasible region. When we try to find the common region for the constraints given to us, we get the following shaded region.

Any point in the shaded region satisfy the inequalities x + y ≤ 4, x ≥ 0 and y ≥ 0. We call this area the feasible region for this linear programming problem with the given constraints. We can also see that, the area of this region is finite and it is bounded by three straight lines. We call such feasible region an bounded feasible region.