The number of corner points of the feasible region determined by the constraints \(x- y\ge 0, 2y \le x + 2, x\ge 0, y \ge 0\) is : (A)\(2\) (B)\(3\) (C)\(4\) (D)\(5\)
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine drawing lines on graph paper to mark where you are allowed to stand. Each rule says you must stay on one side of a line. The safe zone where all rules are happy together is called the feasible region. The corners of that safe zone are special spots called corner points. Here, the safe zone is a small shape with only two corners: the origin \( (0, 0) \) and the point \( (2, 2) \). Counting those corners gives us the answer.
Answer: The feasible region has exactly \( 2 \) corner points, namely \( (0, 0) \) and \( (2, 2) \). Hence the correct option is (A) \( 2 \).
In Linear Programming, each linear inequality (constraint) represents a half-plane. The feasible region is the common area that satisfies all the constraints together. Its boundary is made of straight-line segments, and the points where two boundary lines meet (the vertices of this region) are called corner points. Corner points are important because the optimal value of the objective function always occurs at one of them. To count the corner points, we first draw each boundary line, find the region satisfying all inequalities, and then locate the intersection points that actually lie on the feasible region.
To find a corner point, solve the two boundary equations simultaneously. The boundary lines here are: \( x - y = 0 \), \( 2y = x + 2 \), \( x = 0 \), and \( y = 0 \).
The feasible region has exactly \( 2 \) corner points, namely \( (0, 0) \) and \( (2, 2) \). Hence the correct option is (A) \( 2 \).
A common mistake is to include the point \( (-2, 0) \) obtained from \( 2y = x + 2 \) meeting the x-axis. Since \( x \ge 0 \), this point lies outside the first quadrant and must be rejected. Always verify that each intersection point actually satisfies ALL the constraints before counting it as a corner point.
The feasible region has exactly \( 2 \) corner points, namely \( (0, 0) \) and \( (2, 2) \). Hence the correct option is (A) \( 2 \).
One common mistake: Students count every intersection of boundary lines as a corner point without checking whether each intersection actually satisfies all the constraints, leading to an inflated count that includes points outside the feasible region.
Answer: The feasible region has exactly \( 2 \) corner points, namely \( (0, 0) \) and \( (2, 2) \). Hence the correct option is (A) \( 2 \).
Question: Find the number of corner points of the feasible region determined by the constraints: \( x + y \le 6 \), \( 2x - y \ge 0 \), \( x \ge 0 \), \( y \ge 0 \). (A) 2 (B) 3 (C) 4 (D) 5
Solution: We identify the boundary lines and find their intersections within the feasible region. The constraints are: \[ x + y \le 6 \] \[ 2x - y \ge 0 \quad \text{(i.e., } y \le 2x \text{)} \] \[ x \ge 0, \quad y \ge 0 \] Step 1: Check the origin (0, 0). Testing \( x + y \le 6 \): \( 0 \le 6 \) — satisfied. Testing \( 2x - y \ge 0 \): \( 0 \ge 0 \) — satisfied. So the origin lies in the feasible region. Step 2: Find intersection of \( x + y = 6 \) and \( y = 0 \) (x-axis). Setting \( y = 0 \) in \( x + y = 6 \): \( x = 6 \). Point: \( (6, 0) \). Check \( 2x - y \ge 0 \): \( 12 - 0 = 12 \ge 0 \) — satisfied. Step 3: Find intersection of \( x + y = 6 \) and \( 2x - y = 0 \). From \( y = 2x \), substitute: \( x + 2x = 6 \), so \( 3x = 6 \), giving \( x = 2, y = 4 \). Point: \( (2, 4) \). Check \( x \ge 0, y \ge 0 \): satisfied. Step 4: Find intersection of \( 2x - y = 0 \) and \( y = 0 \) (x-axis). Setting \( y = 0 \): \( 2x = 0 \), so \( x = 0 \). Point: \( (0, 0) \). Check \( x + y \le 6 \): \( 0 \le 6 \) — satisfied. Step 5: Check \( x = 0 \) with \( 2x - y \ge 0 \): gives \( y \le 0 \), combined with \( y \ge 0 \), only \( y = 0 \) is feasible on the y-axis boundary, which is already included in \( (0,0) \). So the feasible region is a triangle with corner points \( (0, 0) \), \( (6, 0) \), and \( (2, 4) \). The number of corner points is 3.
Answer: (B) 3
Question: Find the number of corner points of the feasible region determined by the constraints: \( x + 2y \le 10 \), \( x + y \ge 3 \), \( x \ge 0 \), \( y \ge 0 \). (A) 2 (B) 3 (C) 4 (D) 5
Solution: We find all boundary intersections that lie within the feasible region. The constraints are: \[ x + 2y \le 10 \] \[ x + y \ge 3 \] \[ x \ge 0, \quad y \ge 0 \] Step 1: Intersection of \( x + 2y = 10 \) and \( x = 0 \). Setting \( x = 0 \): \( 2y = 10 \), so \( y = 5 \). Point: \( (0, 5) \). Check \( x + y \ge 3 \): \( 0 + 5 = 5 \ge 3 \) — satisfied. Step 2: Intersection of \( x + 2y = 10 \) and \( y = 0 \). Setting \( y = 0 \): \( x = 10 \). Point: \( (10, 0) \). Check \( x + y \ge 3 \): \( 10 \ge 3 \) — satisfied. Step 3: Intersection of \( x + y = 3 \) and \( x = 0 \). Setting \( x = 0 \): \( y = 3 \). Point: \( (0, 3) \). Check \( x + 2y \le 10 \): \( 0 + 6 = 6 \le 10 \) — satisfied. Step 4: Intersection of \( x + y = 3 \) and \( y = 0 \). Setting \( y = 0 \): \( x = 3 \). Point: \( (3, 0) \). Check \( x + 2y \le 10 \): \( 3 \le 10 \) — satisfied. Step 5: Intersection of \( x + 2y = 10 \) and \( x + y = 3 \). Subtracting: \( (x + 2y) - (x + y) = 10 - 3 \), giving \( y = 7 \). Then \( x = 3 - 7 = -4 \). Since \( x = -4 < 0 \), this point does not satisfy \( x \ge 0 \) — not feasible. So the feasible region is bounded by the four points \( (0, 3) \), \( (0, 5) \), \( (10, 0) \), and \( (3, 0) \). All four satisfy every constraint, and the feasible region is a quadrilateral. The number of corner points is 4.
Answer: (C) 4
Question: The number of corner points of the feasible region determined by the constraints \( 2x - y \ge 0 \), \( x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \) is: (A) 2 (B) 3 (C) 4 (D) 5
Answer: The feasible region has exactly 3 corner points: \( (0, 0) \), \( (6, 0) \), and \( (2, 4) \). Hence the correct option is (B) 3.