SOLVER7 Study. Nothing Else.
2024 Board Paper Q17

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Corner Points of an Unbounded Feasible Region

Detailed Explanation

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.

Formula Used

A corner point is found by solving two boundary equations simultaneously. Relevant boundary lines: \( x = 0 \), \( y = 0 \), and \( x + y = 4 \).

Solution

  1. Step 1: Write down the constraints and identify the boundary lines. The constraints are \( x \ge 0 \), \( y \ge 0 \), and \( x + y \ge 4 \). Their boundary lines are \( x = 0 \) (the y-axis), \( y = 0 \) (the x-axis), and \( x + y = 4 \).
  2. Step 2: Understand the region. Since \( x \ge 0 \) and \( y \ge 0 \), we stay in the first quadrant. Since \( x + y \ge 4 \), we stay on or above the line \( x + y = 4 \). This region stretches out to infinity, so it is unbounded.
  3. Step 3: Find where the line \( x + y = 4 \) meets the axes. Put \( y = 0 \): \[ x + 0 = 4 \Rightarrow x = 4 \] giving the point \( (4, 0) \). Put \( x = 0 \): \[ 0 + y = 4 \Rightarrow y = 4 \] giving the point \( (0, 4) \).
  4. Step 4: Check the origin as a possible corner. The point where \( x = 0 \) meets \( y = 0 \) is \( (0, 0) \). Test it in \( x + y \ge 4 \): \[ 0 + 0 = 0 \] Since \( 0 \ge 4 \) is false, the origin does NOT satisfy the constraint, so \( (0, 0) \) is not a corner point of the feasible region.
  5. Step 5: Verify the two valid corner points. At \( (4, 0) \): \( x = 4 \ge 0 \), \( y = 0 \ge 0 \), and \( 4 + 0 = 4 \ge 4 \) — all true. At \( (0, 4) \): \( x = 0 \ge 0 \), \( y = 4 \ge 0 \), and \( 0 + 4 = 4 \ge 4 \) — all true. So both points lie in the region and are corner points. The region has exactly these two vertices, and it extends to infinity beyond them.

Final Answer

The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List every constraint and its corresponding boundary line. The three constraints are \( x \ge 0 \), \( y \ge 0 \), and \( x + y \ge 4 \). Their boundary lines are the y-axis \( x = 0 \), the x-axis \( y = 0 \), and the line \( x + y = 4 \). — Reason: Identifying boundary lines first tells us exactly which pairs of lines can possibly intersect to form a corner point.
  2. Step 2: Understand the shape of the feasible region. Since \( x \ge 0 \) and \( y \ge 0 \), only points in the first quadrant are allowed. Since \( x + y \ge 4 \), only points on or above the line \( x + y = 4 \) qualify. Together, the feasible region is an unbounded area in the first quadrant lying above the line \( x + y = 4 \). — Reason: Knowing the region is unbounded warns us that not every pair of boundary lines will yield a valid corner point, so we must check each candidate.
  3. Step 3: Find the candidate point where \( x + y = 4 \) meets the x-axis \( y = 0 \). Substituting \( y = 0 \) into \( x + y = 4 \) gives \( x = 4 \), so the candidate is \( (4, 0) \). Now verify: \( x = 4 \ge 0 \) ✓, \( y = 0 \ge 0 \) ✓, and \( 4 + 0 = 4 \ge 4 \) ✓. All constraints are satisfied. — Reason: A candidate is a true corner point only when it satisfies every constraint, so verification is essential.
  4. Step 4: Find the candidate point where \( x + y = 4 \) meets the y-axis \( x = 0 \). Substituting \( x = 0 \) into \( x + y = 4 \) gives \( y = 4 \), so the candidate is \( (0, 4) \). Verification: \( x = 0 \ge 0 \) ✓, \( y = 4 \ge 0 \) ✓, and \( 0 + 4 = 4 \ge 4 \) ✓. All constraints are satisfied. — Reason: Same verification procedure confirms this is also a genuine corner point.
  5. Step 5: Check the remaining pair of boundary lines: \( x = 0 \) and \( y = 0 \). They intersect at the origin \( (0, 0) \). Testing \( x + y \ge 4 \): \( 0 + 0 = 0 \), which is NOT \( \ge 4 \). So \( (0, 0) \) fails the third constraint. — Reason: The origin does not belong to the feasible region, so it cannot be a corner point. This step confirms there are no hidden extra vertices.
  6. Step 6: Count all verified corner points. From Steps 3 and 4 we confirmed exactly two corner points: \( (4, 0) \) and \( (0, 4) \). No other intersections of boundary lines exist in this problem. — Reason: Counting only the verified candidates gives the final answer to the question.

Final Answer

The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Constraints: \( x \ge 0 \), \( y \ge 0 \), \( x + y \ge 4 \). Boundary lines: \( x = 0 \), \( y = 0 \), \( x + y = 4 \).
  2. Step 2: Intersection of \( x + y = 4 \) with \( y = 0 \): \( x = 4 \), giving point \( (4, 0) \). Intersection of \( x + y = 4 \) with \( x = 0 \): \( y = 4 \), giving point \( (0, 4) \).
  3. Step 3: Both \( (4, 0) \) and \( (0, 4) \) satisfy all constraints. The axes \( x = 0 \) and \( y = 0 \) do not intersect within the feasible region (their intersection \( (0,0) \) fails \( x + y \ge 4 \)). Total corner points: 2.

Answer: The feasible region has exactly 2 corner points, namely \( (4, 0) \) and \( (0, 4) \). Hence the correct option is (C) 2.

➕ More Examples

More Examples

Example 1

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

Example 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

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Identify the boundary line: The constraint \( 2x + y \ge 6 \) has the boundary line \( 2x + y = 6 \). Find its intercepts. Setting \( y = 0 \): \( 2x = 6 \), so \( x = 3 \), giving the point \( (3, 0) \). Setting \( x = 0 \): \( y = 6 \), giving the point \( (0, 6) \).
  2. Step 2: Determine the feasible region: The constraints \( x \ge 0 \) and \( y \ge 0 \) restrict the region to the first quadrant. The constraint \( 2x + y \ge 6 \) means we need the region on or above the line \( 2x + y = 6 \) (i.e., away from the origin, since substituting \( (0, 0) \) gives \( 0 \ge 6 \), which is false).
  3. Step 3: Identify candidate corner points: The boundaries are the line \( 2x + y = 6 \), the x-axis (\( y = 0 \)), and the y-axis (\( x = 0 \)). Check intersections that lie in the feasible region. Intersection of \( 2x + y = 6 \) and \( y = 0 \) gives \( (3, 0) \). Intersection of \( 2x + y = 6 \) and \( x = 0 \) gives \( (0, 6) \). Intersection of \( x = 0 \) and \( y = 0 \) gives \( (0, 0) \), but this does NOT satisfy \( 2(0) + 0 \ge 6 \), so it is excluded.
  4. Step 4: Verify the two corner points: Check \( (3, 0) \): \( x = 3 \ge 0 \) ✓, \( y = 0 \ge 0 \) ✓, \( 2(3) + 0 = 6 \ge 6 \) ✓. Check \( (0, 6) \): \( x = 0 \ge 0 \) ✓, \( y = 6 \ge 0 \) ✓, \( 2(0) + 6 = 6 \ge 6 \) ✓. Both points are valid corner points of the feasible region. The region is unbounded (extends towards infinity along both axes), so there are no other finite corner points.
  5. Step 5: Count the corner points: The feasible region has exactly two corner points: \( (3, 0) \) and \( (0, 6) \). Therefore, the correct option is (D) 3 is incorrect; the answer is (C) 2.

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 \).

Everything you get with Solver7

More questions in Linear Programming