SOLVER7 Study. Nothing Else.
2023 Board Paper Q18

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Counting Corner Points of a Feasible Region

Detailed Explanation

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.

Formula Used

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

Solution

  1. Step 1: Write each constraint and its boundary line. The constraints are \( x - y \ge 0 \), \( 2y \le x + 2 \), \( x \ge 0 \), and \( y \ge 0 \). The corresponding boundary lines are \( y = x \), \( 2y = x + 2 \), \( x = 0 \) (the y-axis), and \( y = 0 \) (the x-axis).
  2. Step 2: Interpret each region. \( x - y \ge 0 \) means \( y \le x \) (below the line \( y = x \)). \( 2y \le x + 2 \) means the region on/below the line \( 2y = x + 2 \). Also \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  3. Step 3: Find the intersection of \( y = x \) and \( y = 0 \). Substituting \( y = 0 \) into \( y = x \) gives \( x = 0 \). This gives the origin \( (0, 0) \), which is a corner point.
  4. Step 4: Find where \( 2y = x + 2 \) meets the x-axis \( y = 0 \). Putting \( y = 0 \): \[ 0 = x + 2 \Rightarrow x = -2 \] This point \( (-2, 0) \) has a negative \( x \), so it is NOT in the first quadrant and is rejected. So along the x-axis the feasible region ends at the origin.
  5. Step 5: Find the intersection of \( y = x \) and \( 2y = x + 2 \). Substitute \( x = y \) into the second equation: \[ 2y = y + 2 \Rightarrow y = 2 \] So \( x = 2 \) as well, giving the corner point \( (2, 2) \).
  6. Step 6: Check the y-axis boundary. On \( x = 0 \), the constraint \( y \le x \) becomes \( y \le 0 \), and with \( y \ge 0 \) this forces \( y = 0 \). So the only point on the y-axis is again the origin. No new corner is added here.
  7. Step 7: Collect the valid corner points that lie in the feasible region: the origin \( (0, 0) \) and the intersection \( (2, 2) \). Both satisfy all four constraints, and they are the only vertices of this feasible region.

Final Answer

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

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List all constraints and rewrite each as a boundary line. The four constraints are \( x - y \ge 0 \), \( 2y \le x + 2 \), \( x \ge 0 \), and \( y \ge 0 \). Their boundary lines are \( y = x \), \( 2y = x + 2 \), \( x = 0 \) (y-axis), and \( y = 0 \) (x-axis). — Reason: Boundary lines form the edges of the feasible region, so identifying them is the starting point.
  2. Step 2: Interpret the direction of each inequality. \( x - y \ge 0 \) means \( y \le x \), so the region lies on or below the line \( y = x \). \( 2y \le x + 2 \) means the region lies on or below the line \( 2y = x + 2 \). Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is confined to the first quadrant. — Reason: Knowing which side of each line is valid lets us correctly shade and bound the feasible region.
  3. Step 3: Find the first corner point by intersecting \( y = x \) and \( y = 0 \). Substituting \( y = 0 \) into \( y = x \) gives \( x = 0 \), so the point is \( (0, 0) \). Check all constraints: \( 0 - 0 = 0 \ge 0 \) ✓, \( 2(0) = 0 \le 0 + 2 \) ✓, \( x = 0 \ge 0 \) ✓, \( y = 0 \ge 0 \) ✓. — Reason: The origin is the natural starting vertex where two non-negativity boundaries meet, and we verify it satisfies all constraints.
  4. Step 4: Find the second corner point by intersecting \( y = x \) and \( 2y = x + 2 \). Substitute \( y = x \) into \( 2y = x + 2 \): \[ 2x = x + 2 \] Solving: \[ x = 2, \quad y = 2 \] This gives the point \( (2, 2) \). Check: \( 2 - 2 = 0 \ge 0 \) ✓, \( 2(2) = 4 \le 2 + 2 = 4 \) ✓, \( x = 2 \ge 0 \) ✓, \( y = 2 \ge 0 \) ✓. — Reason: This intersection is where two non-trivial boundary lines meet inside the valid region, making it a corner point.
  5. Step 5: Check whether \( y = 0 \) and \( 2y = x + 2 \) produce a valid corner point. Setting \( y = 0 \) in \( 2y = x + 2 \) gives \( x = -2 \). The point \( (-2, 0) \) fails \( x \ge 0 \), so it lies outside the feasible region. — Reason: Not every intersection of boundary lines is a corner point; we must verify feasibility.
  6. Step 6: Check whether \( x = 0 \) and \( 2y = x + 2 \) produce a valid corner point. Setting \( x = 0 \) gives \( 2y = 2 \), so \( y = 1 \), giving point \( (0, 1) \). Test \( x - y \ge 0 \): \( 0 - 1 = -1 \ge 0 \) is false, so \( (0, 1) \) is not in the feasible region. — Reason: Again, feasibility of all constraints must be confirmed; this point violates the first constraint.
  7. Step 7: Count the valid corner points. Only \( (0, 0) \) and \( (2, 2) \) satisfy all four constraints simultaneously. All other candidate intersections fail at least one constraint. Therefore the total number of corner points of the feasible region is \( 2 \). — Reason: The number of feasible corner points equals the count of vertices that truly lie within the region satisfying every constraint.

Final Answer

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

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Constraints: \( x - y \ge 0 \), \( 2y \le x + 2 \), \( x \ge 0 \), \( y \ge 0 \). Boundary lines: \( y = x \), \( 2y = x + 2 \), \( x = 0 \), \( y = 0 \).
  2. Step 2: Intersection of \( y = x \) and \( y = 0 \): substituting gives \( x = 0 \), corner point \( (0, 0) \).
  3. Step 3: Intersection of \( y = x \) and \( 2y = x + 2 \): substituting \( y = x \) gives \( 2x = x + 2 \), so \( x = 2 \), \( y = 2 \), corner point \( (2, 2) \).
  4. Step 4: No other intersections lie within the feasible region. Total corner points \( = 2 \).

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

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: List the Boundary Lines: The four constraints give the following boundary lines: (i) \( 2x - y = 0 \), i.e., \( y = 2x \) (ii) \( x + y = 6 \) (iii) \( x = 0 \) (the y-axis) (iv) \( y = 0 \) (the x-axis)
  2. Step 2: Find Candidate Corner Points: We check every intersection of pairs of boundary lines to see which ones satisfy all four constraints. Intersection of \( x = 0 \) and \( y = 0 \): Point \( (0, 0) \). Check \( 2(0)-0 = 0 \ge 0 \) ✓ and \( 0+0 = 0 \le 6 \) ✓. Valid. Intersection of \( x = 0 \) and \( y = 2x \): Substituting \( x=0 \) gives \( y=0 \), same point \( (0,0) \). Intersection of \( x = 0 \) and \( x + y = 6 \): \( (0, 6) \). Check \( 2(0)-6 = -6 \ge 0 \) ✗. Not valid. Intersection of \( y = 0 \) and \( y = 2x \): \( y=0 \Rightarrow x=0 \), same point \( (0,0) \). Intersection of \( y = 0 \) and \( x + y = 6 \): \( (6, 0) \). Check \( 2(6)-0 = 12 \ge 0 \) ✓ and \( x=6 \ge 0 \) ✓ and \( y=0 \ge 0 \) ✓. Valid. Intersection of \( y = 2x \) and \( x + y = 6 \): Substituting \( y = 2x \) into \( x + y = 6 \) gives \( x + 2x = 6 \), so \( 3x = 6 \), giving \( x = 2, y = 4 \). Point \( (2, 4) \). Check \( x=2 \ge 0 \) ✓, \( y=4 \ge 0 \) ✓, \( 2(2)-4 = 0 \ge 0 \) ✓, \( 2+4=6 \le 6 \) ✓. Valid.
  3. Step 3: Identify the Feasible Region: The feasible region is bounded by \( y = 2x \) (from below, i.e., \( y \le 2x \)), \( x + y \le 6 \), \( x \ge 0 \), and \( y \ge 0 \). The region is a triangle with three distinct corner points: \( (0, 0) \), \( (6, 0) \), and \( (2, 4) \).
  4. Step 4: Count the Corner Points: The valid corner points of the feasible region are \( (0, 0) \), \( (6, 0) \), and \( (2, 4) \). That gives a total of 3 corner points.

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

Everything you get with Solver7

More questions in Linear Programming