The number of corner points of the feasible region determined by constraints \(x\ge 0, y\ge0, x+y\ge4\) is: (A)\(0\) (B)\(1\) (C)\(2\) (D)\(3\)
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you are standing on a huge floor. Some rules say you cannot go left of a wall or below the ground. Another rule says you must stay beyond a slanted fence. The allowed area is like a giant open region stretching far away. The sharp corners of this allowed area are special meeting points. Here, the slanted fence meets the ground at one spot, \( (4, 0) \), and meets the side wall at another spot, \( (0, 4) \). Those two meeting spots are the only corners of the allowed region.
Answer: The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.
In Linear Programming, the feasible region is the set of all points that satisfy every constraint at the same time. The boundary of this region is made of straight lines coming from the constraints. A corner point (also called a vertex) is a point where two boundary lines of the feasible region actually meet and that meeting point lies inside or on the feasible region. Here the constraints are \( x \ge 0 \), \( y \ge 0 \), and \( x + y \ge 4 \). The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant, and \( x + y \ge 4 \) keeps us on or above the line \( x + y = 4 \). Because the region opens outward without any upper bound, it is an unbounded region. To count corner points, we look at where the boundary line \( x + y = 4 \) meets the axes and check which meeting points actually belong to the region.
A corner point is found by solving two boundary equations simultaneously. Relevant boundary lines: \( x = 0 \), \( y = 0 \), and \( x + y = 4 \).
The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.
A common mistake is to count \( (0, 0) \) as a corner point just because \( x = 0 \) and \( y = 0 \) meet there. But \( (0, 0) \) fails the constraint \( x + y \ge 4 \), so it is not part of the feasible region and must not be counted.
The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.
One common mistake: students include the origin \( (0, 0) \) as a corner point because it lies at the intersection of \( x = 0 \) and \( y = 0 \), forgetting to verify that it must also satisfy \( x + y \ge 4 \). Since \( 0 + 0 = 0 \lt 4 \), the origin is outside the feasible region and is not a corner point.
Answer: The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.
Question: Find the number of corner points of the feasible region determined by the constraints \( x \ge 0 \), \( y \ge 0 \), and \( 2x + y \ge 6 \).
Solution: Step 1: Identify the boundary line. The boundary of the constraint \( 2x + y \ge 6 \) is the line \( 2x + y = 6 \). Step 2: Find intercepts of the line \( 2x + y = 6 \). When \( x = 0 \): \( y = 6 \), giving point \( (0, 6) \). When \( y = 0 \): \( 2x = 6 \), so \( x = 3 \), giving point \( (3, 0) \). Step 3: Identify the feasible region. The constraints \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant. The constraint \( 2x + y \ge 6 \) means we need points on or above the line \( 2x + y = 6 \). The feasible region is the portion of the first quadrant that lies on or above the line \( 2x + y = 6 \). This region is unbounded (extends to infinity). Step 4: Identify the corner points. The feasible region has exactly two corner points: \( (0, 6) \) (intersection of \( 2x + y = 6 \) with the y-axis) and \( (3, 0) \) (intersection of \( 2x + y = 6 \) with the x-axis). There is no third vertex because the region is unbounded in both the positive x and positive y directions beyond these points. Step 5: Count the corner points. Total corner points \( = 2 \).
Answer: 2
Question: The feasible region is defined by the constraints \( x \ge 0 \), \( y \ge 0 \), \( x + 2y \le 8 \), and \( x + y \ge 3 \). How many corner points does this feasible region have?
Solution: Step 1: List all boundary lines. The boundaries are \( x = 0 \) (y-axis), \( y = 0 \) (x-axis), \( x + 2y = 8 \), and \( x + y = 3 \). Step 2: Find the intercepts of each line. For \( x + 2y = 8 \): When \( x = 0 \), \( y = 4 \) giving \( (0, 4) \). When \( y = 0 \), \( x = 8 \) giving \( (8, 0) \). For \( x + y = 3 \): When \( x = 0 \), \( y = 3 \) giving \( (0, 3) \). When \( y = 0 \), \( x = 3 \) giving \( (3, 0) \). Step 3: Find all intersection points that could be corner points of the feasible region. Intersection of \( x + 2y = 8 \) and \( x + y = 3 \): Subtracting the second from the first gives \( y = 5 \). Substituting back: \( x = 3 - 5 = -2 \). The point \( (-2, 5) \) does not satisfy \( x \ge 0 \), so it is NOT in the feasible region. Intersection of \( x + 2y = 8 \) and \( y = 0 \): \( x = 8 \), giving \( (8, 0) \). Check \( x + y \ge 3 \): \( 8 + 0 = 8 \ge 3 \). Valid. Intersection of \( x + 2y = 8 \) and \( x = 0 \): \( y = 4 \), giving \( (0, 4) \). Check \( x + y \ge 3 \): \( 0 + 4 = 4 \ge 3 \). Valid. Intersection of \( x + y = 3 \) and \( y = 0 \): \( x = 3 \), giving \( (3, 0) \). Check \( x + 2y \le 8 \): \( 3 + 0 = 3 \le 8 \). Valid. Intersection of \( x + y = 3 \) and \( x = 0 \): \( y = 3 \), giving \( (0, 3) \). Check \( x + 2y \le 8 \): \( 0 + 6 = 6 \le 8 \). Valid. Step 4: List all valid corner points: \( (0, 3) \), \( (0, 4) \), \( (8, 0) \), \( (3, 0) \). The feasible region is a bounded quadrilateral with these four vertices. Step 5: Count the corner points. Total corner points \( = 4 \).
Answer: 4
Question: Find the number of corner points of the feasible region determined by the constraints \( x \ge 0 \), \( y \ge 0 \), and \( 2x + y \ge 6 \). (A) 0 (B) 1 (C) 2 (D) 3
Answer: The feasible region has exactly 2 corner points, namely \( (3, 0) \) and \( (0, 6) \). Hence the correct option is (C) 2. Note: Although the number of corner points is still 2, the corner points themselves are different — \( (3, 0) \) and \( (0, 6) \) instead of \( (4, 0) \) and \( (0, 4) \) — due to the different constraint \( 2x + y \ge 6 \).