SOLVER7 Study. Nothing Else.
2026 Board Paper Q14

The region represented by the system of inequations \(3x+y \ge3,\ 2x-y\ge -5,\ x,y\ge 0 \) is: (A)unbounded in \(1^{st}\) quadrant (B)bounded in \(1^{st}\) quadrant (C)unbounded in \(2^{nd}\) quadrant (D)bounded in \(2^{nd}\) quadrant

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are standing in a huge park. Some rules tell you where you are allowed to walk. Here, the rules say you must stay in the positive corner of the park — where both left-right and up-down directions are positive. Two extra rules push you away from the origin. No fence closes off the region completely. You can always walk further and further into the positive corner without hitting a wall. That is what "unbounded" means — the allowed area goes on forever in one direction.

Answer: Option (A): The region is unbounded in the first quadrant.

📖 Identifying the Feasible Region of a System of Inequations

Detailed Explanation

In Linear Programming, a system of linear inequalities defines a feasible region — the set of all points that satisfy every inequality at once. To find it, we treat each inequality as a line, then decide which side of the line to shade. The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict all points to the first quadrant (where both coordinates are non-negative). A region is bounded if it can be enclosed inside some circle of finite radius; otherwise it is unbounded (extends infinitely).

Formula Used

For a line \( ax + by = c \), test a point (usually the origin \( (0,0) \)) in the inequality: if it satisfies the inequality, shade the side containing the origin; otherwise shade the opposite side.

Solution

  1. Step 1: Note the quadrant restriction. The conditions \( x \ge 0 \) and \( y \ge 0 \) force every feasible point to lie in the first quadrant. So the answer must be either option (A) or (B).
  2. Step 2: Analyse the first inequality \( 3x + y \ge 3 \). The boundary line is \( 3x + y = 3 \). Test the origin: \( 3(0) + 0 = 0 \), which is not \( \ge 3 \). So the origin does NOT satisfy this inequality, and we shade the side away from the origin.
  3. Step 3: Analyse the second inequality \( 2x - y \ge -5 \). The boundary line is \( 2x - y = -5 \). Test the origin: \( 2(0) - 0 = 0 \), and \( 0 \ge -5 \) is true. So the origin satisfies this inequality, and we shade the side containing the origin.
  4. Step 4: Combine all conditions in the first quadrant. We keep points that are in the first quadrant, on the far side of \( 3x + y = 3 \), and on the origin side of \( 2x - y = -5 \). In the first quadrant, \( 2x - y \ge -5 \) is automatically true for most points (since large \( x \) and moderate \( y \) keep it satisfied), so the binding restriction is \( 3x + y \ge 3 \).
  5. Step 5: Check boundedness. Points such as \( (10, 10) \) satisfy \( 3x + y = 40 \ge 3 \), \( 2x - y = 10 \ge -5 \), and lie in the first quadrant. We can move as far out as we like along increasing \( x \) or \( y \) and still stay in the region. Since no finite circle can enclose it, the region is unbounded.
  6. Step 6: Conclude. The feasible region lies in the first quadrant and extends infinitely, so it is unbounded in the first quadrant.

Final Answer

Option (A): The region is unbounded in the first quadrant.

Common Mistake

A common error is assuming the region is bounded just because the boundary lines cross. Always test whether points arbitrarily far from the origin (like \( (10,10) \)) still satisfy all inequalities — if they do, the region is unbounded.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the quadrant restriction from the conditions \( x \ge 0 \) and \( y \ge 0 \) — Reason: These two non-negativity constraints confine every feasible point to the first quadrant, so we can immediately rule out options that involve other quadrants and focus only on whether the region inside the first quadrant is bounded or unbounded.
  2. Step 2: Examine the boundary line for the first inequality \( 3x + y \ge 3 \). The boundary is the line \( 3x + y = 3 \). Substitute the origin: \( 3(0) + 0 = 0 \), and since \( 0 \ge 3 \) is false, the origin does NOT satisfy this inequality — Reason: This tells us we must shade the region on the side of the line that does NOT contain the origin, meaning we keep points where \( 3x + y \) is large (away from the origin, further into the first quadrant).
  3. Step 3: Examine the boundary line for the second inequality \( 2x - y \ge -5 \). The boundary is \( 2x - y = -5 \). Substitute the origin: \( 2(0) - 0 = 0 \), and since \( 0 \ge -5 \) is true, the origin DOES satisfy this inequality — Reason: We therefore shade the side containing the origin for this constraint, which is a relatively mild restriction that accepts a wide range of points in the first quadrant.
  4. Step 4: Find the intersection of the two boundary lines to locate a corner of the feasible region. Solve the system \( 3x + y = 3 \) and \( 2x - y = -5 \) simultaneously by adding them: \[ 5x = -2 \implies x = -\frac{2}{5} \] — Reason: A negative \( x \)-value means this particular intersection point lies outside the first quadrant, so it is not a vertex of our feasible region. The actual boundary vertices on the axes must be checked instead.
  5. Step 5: Find where each boundary line meets the coordinate axes within the first quadrant. For \( 3x + y = 3 \): setting \( x = 0 \) gives \( y = 3 \), and setting \( y = 0 \) gives \( x = 1 \), so the intercepts are \( (0, 3) \) and \( (1, 0) \). For \( 2x - y = -5 \): setting \( x = 0 \) gives \( y = 5 \), i.e. the point \( (0, 5) \) — Reason: Locating the axis intercepts helps sketch the feasible region and see whether it closes off or extends indefinitely.
  6. Step 6: Combine all constraints and observe the shape of the feasible region. In the first quadrant, the inequality \( 3x + y \ge 3 \) cuts away the small triangular region near the origin (below-left of the line). The inequality \( 2x - y \ge -5 \) is satisfied by the origin and imposes only a mild upper-left boundary. As \( x \) and \( y \) grow large in the first quadrant, all conditions remain satisfied — Reason: Because there is no upper bound on how large \( x \) or \( y \) can be while still satisfying every inequality, the feasible region extends infinitely and is therefore unbounded.

Final Answer

Option (A): The region is unbounded in the first quadrant.

Common Mistake

One common mistake: Students sometimes confuse 'the region is in the first quadrant' with 'the region is bounded.' Being restricted to the first quadrant does not make a region bounded — it can still stretch infinitely along the positive \( x \)-axis or positive \( y \)-axis. Always check whether the feasible region has a finite upper or outer boundary before concluding it is bounded.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Conditions \( x \ge 0 \), \( y \ge 0 \) restrict the feasible region to the first quadrant.
  2. Step 2: For \( 3x + y \ge 3 \): test origin \( \Rightarrow 0 \ge 3 \) (false), so shade away from origin.
  3. Step 3: For \( 2x - y \ge -5 \): test origin \( \Rightarrow 0 \ge -5 \) (true), so shade toward origin.
  4. Step 4: Combined feasible region in the first quadrant extends without bound (no enclosing circle possible). Region is unbounded.

Answer: Option (A): The region is unbounded in the first quadrant.

➕ More Examples

More Examples

Example 1

Question: The region represented by the system of inequalities \( x + 2y \ge 4,\; x - y \le 6,\; x \ge 0,\; y \ge 0 \) is: (A) Bounded in the 1st quadrant (B) Unbounded in the 1st quadrant (C) Bounded in the 2nd quadrant (D) Unbounded in the 2nd quadrant

Solution: We analyse each constraint in the first quadrant (\( x \ge 0,\; y \ge 0 \)). Constraint 1: \( x + 2y \ge 4 \) Boundary line: \( x + 2y = 4 \) X-intercept: set \( y = 0 \), so \( x = 4 \), giving point \( (4,\,0) \). Y-intercept: set \( x = 0 \), so \( y = 2 \), giving point \( (0,\,2) \). Test origin \( (0,0) \): \( 0 + 0 = 0 \not\ge 4 \). So the feasible side is away from the origin (above/right of this line). Constraint 2: \( x - y \le 6 \) Boundary line: \( x - y = 6 \) X-intercept: set \( y = 0 \), so \( x = 6 \), giving point \( (6,\,0) \). Y-intercept: set \( x = 0 \), so \( y = -6 \) (outside the first quadrant). Test origin \( (0,0) \): \( 0 - 0 = 0 \le 6 \). So the feasible side includes the origin (left/above this line). Finding corner points in the first quadrant: Intersection of \( x + 2y = 4 \) and \( x - y = 6 \): Subtracting the second from the first: \( 3y = -2 \), so \( y = -\tfrac{2}{3} \). Since \( y < 0 \), this intersection is outside the first quadrant. The boundary of the feasible region in the first quadrant consists of: - Part of the line \( x + 2y = 4 \) from \( (0,\,2) \) to \( (4,\,0) \). - The x-axis from \( (4,\,0) \) onward (to the right, since \( x - y \le 6 \) is satisfied for moderate \( x \) on the x-axis). - The y-axis upward from \( (0,\,2) \). On the x-axis (\( y = 0 \)): \( x \ge 4 \) and \( x \le 6 \) — so the x-axis segment ends at \( (6,\,0) \). But as \( y \) increases without bound, both constraints can still be satisfied (e.g. take \( x = 0,\; y \to \infty \): \( 0 + 2y \ge 4 \) ✓ and \( 0 - y \le 6 \) ✓). Hence the region extends infinitely upward along the y-axis. Therefore, the feasible region is unbounded in the first quadrant.

Answer: (B) Unbounded in the 1st quadrant

Example 2

Question: The region represented by the system of inequalities \( 2x + y \le 8,\; x + 3y \le 12,\; x \ge 0,\; y \ge 0 \) is: (A) Unbounded in the 1st quadrant (B) Bounded in the 2nd quadrant (C) Bounded in the 1st quadrant (D) Unbounded in the 2nd quadrant

Solution: We analyse each constraint in the first quadrant (\( x \ge 0,\; y \ge 0 \)). Constraint 1: \( 2x + y \le 8 \) Boundary line: \( 2x + y = 8 \) X-intercept: \( x = 4,\; y = 0 \) — point \( (4,\,0) \). Y-intercept: \( x = 0,\; y = 8 \) — point \( (0,\,8) \). Test origin: \( 0 \le 8 \) ✓. Feasible side is toward the origin (below-left of this line). Constraint 2: \( x + 3y \le 12 \) Boundary line: \( x + 3y = 12 \) X-intercept: \( x = 12,\; y = 0 \) — point \( (12,\,0) \). Y-intercept: \( x = 0,\; y = 4 \) — point \( (0,\,4) \). Test origin: \( 0 \le 12 \) ✓. Feasible side is toward the origin (below-left of this line). Finding corner points of the feasible region: Corner A: Intersection of x-axis and \( 2x + y = 8 \): \( (4,\,0) \). Corner B: Intersection of \( 2x + y = 8 \) and \( x + 3y = 12 \). From the first equation: \( y = 8 - 2x \). Substituting: \( x + 3(8 - 2x) = 12 \), so \( x + 24 - 6x = 12 \), giving \( -5x = -12 \), hence \( x = \tfrac{12}{5} \) and \( y = 8 - \tfrac{24}{5} = \tfrac{16}{5} \). Corner B: \( \left(\tfrac{12}{5},\,\tfrac{16}{5}\right) \). Corner C: Intersection of y-axis and \( x + 3y = 12 \): \( (0,\,4) \). Corner D: Origin \( (0,\,0) \). The four corners are \( (0,\,0) \), \( (4,\,0) \), \( \left(\tfrac{12}{5},\,\tfrac{16}{5}\right) \), and \( (0,\,4) \). These form a closed polygon entirely within the first quadrant. The feasible region cannot extend to infinity because both constraints impose upper bounds on \( x \) and \( y \): from Constraint 1, \( y \le 8 - 2x \le 8 \); from Constraint 2, \( x \le 12 - 3y \le 12 \). Hence the region is enclosed on all sides. Therefore, the feasible region is bounded in the first quadrant.

Answer: (C) Bounded in the 1st quadrant

🎯 Try a Similar Question

Try a Similar Question

Question: The region represented by the system of inequations \( x + 2y \le 10,\ x + y \ge 1,\ x \ge 0,\ y \ge 0 \) is: (A) Unbounded in the first quadrant (B) Bounded in the first quadrant (C) Unbounded in the second quadrant (D) Bounded in the second quadrant

Solution

  1. Step 1: Identify the boundary lines: The boundary lines are \( x + 2y = 10 \) and \( x + y = 1 \), along with the axes \( x = 0 \) and \( y = 0 \).
  2. Step 2: Find key corner points: Find where \( x + 2y = 10 \) meets the axes: at \( (10,\ 0) \) and \( (0,\ 5) \). Find where \( x + y = 1 \) meets the axes: at \( (1,\ 0) \) and \( (0,\ 1) \). Now find the intersection of the two lines \( x + 2y = 10 \) and \( x + y = 1 \). Subtracting the second from the first gives \( y = 9 \), and substituting back gives \( x = 1 - 9 = -8 \). Since \( x \ge 0 \), this intersection is outside the feasible region.
  3. Step 3: Check which side of each line satisfies the inequality: For \( x + 2y \le 10 \): test the origin \( (0, 0) \): \( 0 + 0 = 0 \le 10 \). True, so the feasible side is towards the origin (below-left of the line). For \( x + y \ge 1 \): test the origin \( (0, 0) \): \( 0 + 0 = 0 \not\ge 1 \). False, so the feasible side is away from the origin (above-right of the line). Combined with \( x \ge 0 \) and \( y \ge 0 \), the region lies entirely in the first quadrant.
  4. Step 4: Identify the corner points of the feasible region: The feasible region in the first quadrant is bounded by: the segment of \( x + y = 1 \) from \( (1,\ 0) \) to \( (0,\ 1) \), the segment of \( x + 2y = 10 \) from \( (10,\ 0) \) to \( (0,\ 5) \), and the axes. The corner points are \( (1,\ 0) \), \( (10,\ 0) \), \( (0,\ 5) \), and \( (0,\ 1) \).
  5. Step 5: Determine if the region is bounded or unbounded: All four corner points are finite. The feasible region is the set of all points in the first quadrant satisfying both \( x + y \ge 1 \) and \( x + 2y \le 10 \). This region is enclosed on all sides — above by \( x + 2y = 10 \), below-left by \( x + y = 1 \) and the axes — forming a closed, finite polygon. Therefore, the feasible region is bounded in the first quadrant.

Answer: Option (B): The region is bounded in the first quadrant.

Everything you get with Solver7

More questions in Linear Programming