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
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you have several rules about where you can stand in a park. Maybe one rule says stay left of the big tree, another says stay above the fountain. The only safe spot is where ALL those rules are happy at the same time. In maths problems about making something as big or small as possible, we draw all these rules on graph paper. The patch of land where every single rule is satisfied together is called the feasible region. Every point inside that patch is an allowed answer.
Answer: (D) a feasible region
In a Linear Programming Problem (LPP), we want to maximise or minimise a linear objective function subject to a set of linear inequalities called constraints. Each constraint (including the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \)) represents a half-plane in the coordinate plane. When we plot all these constraints together, they overlap in a certain area. The set of points that satisfy ALL the constraints at the same time is the common region. This common region contains every possible solution that is allowed by the problem, which is why it is called the feasible region. Each point inside or on the boundary of this region is called a feasible solution. The feasible region may be bounded (enclosed on all sides) or unbounded, but regardless of its shape, the name for the common region is always the feasible region.
General LPP form: Maximise or Minimise \( Z = ax + by \) subject to constraints of the type \( a_1 x + b_1 y \le c_1 \), and \( x \ge 0 \), \( y \ge 0 \). The feasible region is the set of all \( (x, y) \) satisfying every constraint.
(D) a feasible region
A common mistake is to confuse the terms: 'bounded' and 'unbounded' only describe the shape of the feasible region, and 'optimal' refers to the particular corner point that maximises or minimises \( Z \). None of these is the name of the common region itself, which is always called the feasible region.
(D) a feasible region
One common mistake: Students sometimes confuse the feasible region with just the optimal point (corner point). The feasible region is the entire common area of all the constraint half-planes, not merely the single point where the objective function is maximised or minimised.
Answer: (D) a feasible region
Question: In a Linear Programming Problem, a manufacturer produces two products P and Q subject to several resource constraints and non-negativity conditions. The set of all points \( (x, y) \) that satisfy each and every constraint of the problem simultaneously is known as: (A) the optimal region (B) the infeasible region (C) the feasible region (D) the objective region
Solution: In a Linear Programming Problem, every constraint (including \( x \ge 0 \) and \( y \ge 0 \)) defines a half-plane on the coordinate plane. The intersection of all these half-planes — that is, the set of all points \( (x, y) \) that satisfy every constraint at the same time — is called the feasible region. The feasible region may be bounded (enclosed) or unbounded (extending infinitely in some direction), depending on the constraints. Key distinctions: - Option (A): The optimal region is not a standard term; it refers to the single optimal point, not a region. - Option (B): The infeasible region consists of points that violate at least one constraint. - Option (C): The feasible region is exactly the common region satisfying all constraints simultaneously. - Option (D): Objective region is not a defined term in LPP. Therefore, the correct answer is Option (C).
Answer: (C) the feasible region
Question: A diet problem in Linear Programming involves variables \( x \) and \( y \) representing quantities of two food items. After plotting all the inequality constraints on a graph, a dietitian shades the region that satisfies all constraints together. This shaded common region is referred to as: (A) a convex polygon only if bounded (B) the feasible region (C) the optimal solution set (D) an infeasible zone
Solution: In Linear Programming, each inequality constraint corresponds to a half-plane in the \( xy \)-plane. For example, a constraint such as \( 2x + 3y \le 120 \) corresponds to all points on one side of the line \( 2x + 3y = 120 \). When all constraints — including non-negativity restrictions \( x \ge 0 \) and \( y \ge 0 \) — are considered together, the region common to all the corresponding half-planes is the set of all feasible (allowable) solutions. This common region is called the feasible region. Checking each option: - Option (A): While a bounded feasible region is indeed a convex polygon, this description is incomplete and does not name the region correctly in the context of LPP. - Option (B): The feasible region is precisely the term for the common region satisfying all constraints simultaneously — this is correct. - Option (C): The optimal solution is a specific point (or points) within the feasible region that maximises or minimises the objective function, not the entire region. - Option (D): The infeasible zone refers to points that do NOT satisfy all constraints. Hence, the correct answer is Option (B).
Answer: (B) the feasible region
Question: In a Linear Programming Problem, the point (or points) in the feasible region at which the objective function attains its maximum or minimum value is called: (A) a corner point (B) an optimal solution (C) a feasible solution (D) a bounded solution
Answer: (B) an optimal solution