Class 12 Maths, Worked in Full Past papersGet updates
CBSE Board Examination 2023 · Section A · 1 mark

Q18: Number of corner points for x−y≥0x - y \ge 0⁠, 2y≤x+22y \le x + 2⁠, x,y≥0x, y \ge 0

The question

The number of corner points of the feasible region determined by the constraints x−y≥0x - y \ge 0⁠, 2y≤x+22y \le x + 2⁠, x≥0x \ge 0⁠, y≥0y \ge 0 is :

(a) 22

(b) 33

(c) 44

(d) 55

Exam answer

The boundary lines are x−y=0x - y = 0⁠, 2y=x+22y = x + 2⁠, x=0x = 0 and y=0y = 0⁠.

Putting y=xy = x in 2y=x+22y = x + 2⁠:

2x=x+2⇒ x=2, y=2\begin{aligned} &2x = x + 2 \\ \Rightarrow\ &x = 2,\ y = 2 \end{aligned}

The lines x−y=0x - y = 0 and 2y=x+22y = x + 2 meet at (2,2)(2, 2)⁠.

Why?

A corner point is a point where two boundary lines meet and which satisfies every constraint. So we find where each pair of lines meets, then test each point.

x−y=0x - y = 0 is the same as y=xy = x⁠, which is why we can put y=xy = x into the other equation.

2x=x+22x−x=2x=2\begin{aligned} 2x &= x + 2 \\ 2x - x &= 2 \\ x &= 2 \end{aligned}

Then y=xy = x gives y=2y = 2⁠.

x−y=0x - y = 0 meets both axes at O(0,0)O(0, 0)⁠.

2y=x+22y = x + 2 meets x=0x = 0 at (0,1)(0, 1) and y=0y = 0 at (−2,0)(-2, 0)⁠.

(0,1)(0, 1) fails x−y≥0x - y \ge 0⁠, and (−2,0)(-2, 0) fails x≥0x \ge 0⁠.

Why?

Where 2y=x+22y = x + 2 meets the axes:

x=0: 2y=0+2⇒y=22=1y=0: 2(0)=x+2⇒0=x+2⇒x=−2\begin{aligned} &x = 0\text{: } 2y = 0 + 2 \\ &\Rightarrow y = \frac{2}{2} = 1 \\[4pt] &y = 0\text{: } 2(0) = x + 2 \\ &\Rightarrow 0 = x + 2 \\ &\Rightarrow x = -2 \end{aligned}

At (0,1)(0, 1)⁠: x−y=−1x - y = -1⁠, which is negative. At (−2,0)(-2, 0)⁠: x=−2x = -2⁠, which is negative. So neither point is in the feasible region.

(2,2)(2, 2) and O(0,0)O(0, 0) satisfy all four constraints. For example, at (2,2)(2, 2)⁠: x−y=0x - y = 0 and 2y=4=x+22y = 4 = x + 2⁠.

The feasible region is unbounded, with corner points O(0,0)O(0, 0) and (2,2)(2, 2)⁠.

Why?

The region lies above y=0y = 0⁠, below y=xy = x and below y=x+22y = \frac{x + 2}{2}⁠. Its edges run from OO along y=xy = x to (2,2)(2, 2)⁠, then along 2y=x+22y = x + 2 for ever, and from OO along the xx-axis for ever.

Points such as (10,0)(10, 0) satisfy every constraint, so the region is unbounded. Its only corners are O(0,0)O(0, 0) and (2,2)(2, 2)⁠, so there are 2.

Answer: (a) 22

Where this comes from

Chapter 12, Linear Programming: Corner points of a feasible region.

Found an error?

Tell us if something on this page is wrong or unclear. Send feedback on this question →