SOLVER7 Study. Nothing Else.
2023 Board Paper Q18

The feasible region of a linear programming problem is shown in the figure below : Which of the following are the possible constraints ?
(A)\(x + 2y \ge 4, x + y \le 3, x \ge 0, y \ge \)0
(B)\(x+2y\le4,\ x+y\le3,\ x\ge0,\ y\ge0\)
(C)\(x+2y\ge4,\ x+y\ge3,\ x\ge0,\ y\ge0\)
(D)\(x+2y\ge4,\ x+y\ge3,\ x\le0,\ y\le0\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine two fences drawn on a map, and a safe zone on one side of both fences. The safe zone never includes the starting corner of the map. Each fence is a straight line, like the line joining points \( (4, 0) \) and \( (0, 2) \), or the line joining \( (3, 0) \) and \( (0, 3) \). Because the safe zone is on the far side of both fences, the rules use 'greater than or equal to'. Since we also stay in the positive corner of the map, both \( x \) and \( y \) must be at least zero.

Answer: Option (C): \(x + 2y \ge 4,\ x + y \ge 3,\ x \ge 0,\ y \ge 0\).

📖 Finding Constraints from a Feasible Region

Detailed Explanation

In Linear Programming, a straight line divides the plane into two half-planes. The feasible region is the common part (intersection) of all the half-planes defined by the constraints. To decide the inequality sign for each line, we pick a test point (usually the origin) and check whether the shaded region lies on the same side as that point. From the figure, the shading (feasible region) is the region ABOVE both lines and to the right, staying within the first quadrant. The line \(x + 2y = 4\) passes through \((4,0)\) and \((0,2)\), while the line \(x + y = 3\) passes through \((3,0)\) and \((0,3)\). Since the origin does NOT lie in the shaded region, the inequalities must exclude the origin side, giving 'greater than or equal to' signs. Because the region is entirely in the first quadrant, we also need \(x \ge 0\) and \(y \ge 0\).

Formula Used

For a line \(ax + by = c\): test the origin \((0,0)\). If the origin lies in the feasible (shaded) region, the constraint is \(ax + by \le c\); if the origin is outside, the constraint is \(ax + by \ge c\).

Solution

  1. Step 1: Identify the two boundary lines from the figure. One line has intercepts \((4,0)\) and \((0,2)\), giving \(x + 2y = 4\). The other line has intercepts \((3,0)\) and \((0,3)\), giving \(x + y = 3\).
  2. Step 2: Test the origin for the line \(x + 2y = 4\). Substitute \((0,0)\): \[0 + 2(0) = 0\] Since \(0 < 4\), the origin lies on the side where \(x + 2y < 4\). But the shaded feasible region is on the opposite side (away from the origin), so the constraint is \(x + 2y \ge 4\).
  3. Step 3: Test the origin for the line \(x + y = 3\). Substitute \((0,0)\): \[0 + 0 = 0\] Since \(0 < 3\), the origin satisfies \(x + y < 3\). Again the shaded region lies away from the origin, so the constraint is \(x + y \ge 3\).
  4. Step 4: Observe that the feasible region lies entirely in the first quadrant (both axes positive). This means \(x \ge 0\) and \(y \ge 0\) are also required as non-negativity constraints.
  5. Step 5: Combine all four constraints obtained: \[x + 2y \ge 4, \quad x + y \ge 3, \quad x \ge 0, \quad y \ge 0\] This matches option (C).

Final Answer

Option (C): \(x + 2y \ge 4,\ x + y \ge 3,\ x \ge 0,\ y \ge 0\).

Common Mistake

A common mistake is choosing \(\le\) signs (option B) by assuming the origin is inside the region. Since the shaded region lies away from the origin, the correct signs are \(\ge\). Another error is writing \(x \le 0, y \le 0\) (option D), which would place the region in the third quadrant, contradicting the first-quadrant figure.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read off the intercepts of the first boundary line from the figure. The line crosses the x-axis at \( (4, 0) \) and the y-axis at \( (0, 2) \). Using the intercept form, the equation is \[ \frac{x}{4} + \frac{y}{2} = 1 \] which simplifies to \( x + 2y = 4 \). — Reason: Identifying the intercepts is the quickest way to write the equation of a straight line from a graph.
  2. Step 2: Read off the intercepts of the second boundary line. The line crosses the x-axis at \( (3, 0) \) and the y-axis at \( (0, 3) \). Using the intercept form, the equation is \[ \frac{x}{3} + \frac{y}{3} = 1 \] which simplifies to \( x + y = 3 \). — Reason: Same approach as Step 1, using both axis-intercepts to uniquely determine the line.
  3. Step 3: Test the origin \( (0, 0) \) in the first boundary line \( x + 2y = 4 \). Substitute to get \[ 0 + 2(0) = 0 \] Since \( 0 < 4 \), the origin satisfies \( x + 2y < 4 \), meaning it lies on the side where \( x + 2y < 4 \). — Reason: The origin is the simplest test point; its position relative to the line tells us which half-plane each region belongs to.
  4. Step 4: Observe from the figure that the shaded feasible region does NOT contain the origin. Since the origin satisfies \( x + 2y < 4 \) but is outside the feasible region, the feasible region must lie on the opposite side, giving the constraint \( x + 2y \ge 4 \). — Reason: The feasible region is the half-plane that does not contain the origin, so the inequality sign must be reversed relative to what the origin satisfies.
  5. Step 5: Test the origin \( (0, 0) \) in the second boundary line \( x + y = 3 \). Substitute to get \[ 0 + 0 = 0 \] Since \( 0 < 3 \), the origin satisfies \( x + y < 3 \), so it lies on the side where \( x + y < 3 \). — Reason: We apply the same origin-test logic to determine the correct inequality direction for the second constraint.
  6. Step 6: Again, since the feasible region does NOT include the origin, the feasible region lies where \( x + y > 3 \), giving the constraint \( x + y \ge 3 \). — Reason: Consistency with Step 4; because the origin is excluded from the shaded region, both constraints must use \( \ge \).
  7. Step 7: From the figure, the entire feasible region lies in the first quadrant (both x and y are non-negative). Therefore, we add the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \). — Reason: Non-negativity constraints are standard in most real-world LP problems and are directly visible since the shaded region does not extend into negative axes.
  8. Step 8: Combine all constraints identified in Steps 4, 6, and 7. The complete set of constraints describing the feasible region is \( x + 2y \ge 4 \), \( x + y \ge 3 \), \( x \ge 0 \), and \( y \ge 0 \). Comparing with the given options, this matches Option (C). — Reason: Listing all constraints together gives the full system that defines the feasible region shown in the figure.

Final Answer

Option (C): \(x + 2y \ge 4,\ x + y \ge 3,\ x \ge 0,\ y \ge 0\).

Common Mistake

One common mistake: Students often assume the origin always lies in the feasible region and write \( \le \) for both constraints. Always check the figure carefully — if the shaded region is above and away from the origin, the correct sign is \( \ge \), not \( \le \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Boundary lines from intercepts: \( (4,0),(0,2) \Rightarrow x+2y=4 \) and \( (3,0),(0,3) \Rightarrow x+y=3 \).
  2. Step 2: Test origin \( (0,0) \): \( 0+2(0)=0<4 \) and \( 0+0=0<3 \), so origin lies outside the shaded region.
  3. Step 3: Origin excluded \( \Rightarrow \) both constraints use \( \ge \); first quadrant gives \( x\ge 0,\ y\ge 0 \).

Answer: Option (C): \(x + 2y \ge 4,\ x + y \ge 3,\ x \ge 0,\ y \ge 0\).

➕ More Examples

More Examples

Example 1

Question: The feasible region of a linear programming problem has corner points at \( (0, 5) \), \( (2, 3) \), and \( (4, 0) \). The boundary lines are \( x + y = 5 \) and \( x + 2y = 8 \), and the region lies in the first quadrant. Which of the following represents the correct set of constraints? (A) \( x + y \le 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \) (B) \( x + y \ge 5,\; x + 2y \ge 8,\; x \ge 0,\; y \ge 0 \) (C) \( x + y \le 5,\; x + 2y \ge 8,\; x \ge 0,\; y \ge 0 \) (D) \( x + y \ge 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \)

Solution: We identify the boundary lines and check which side of each line the feasible region lies on. The two boundary lines are \( x + y = 5 \) and \( x + 2y = 8 \). The corner points of the feasible region are \( (0, 5) \), \( (2, 3) \), and \( (4, 0) \). This is a bounded triangular region in the first quadrant. Since the region is in the first quadrant, the non-negativity constraints are \( x \ge 0 \) and \( y \ge 0 \). Now test an interior point of the feasible region. The centroid of the triangle is approximately \[ \left(\frac{0+2+4}{3},\; \frac{5+3+0}{3}\right) = \left(2,\; \frac{8}{3}\right) \] Test the point \( \left(2, \frac{8}{3}\right) \) in the first constraint \( x + y \) vs 5: \[ 2 + \frac{8}{3} = \frac{6+8}{3} = \frac{14}{3} \approx 4.67 \] Since \( 4.67 < 5 \), the interior satisfies \( x + y \le 5 \). Test the same point in the second constraint \( x + 2y \) vs 8: \[ 2 + 2 \times \frac{8}{3} = 2 + \frac{16}{3} = \frac{6+16}{3} = \frac{22}{3} \approx 7.33 \] Since \( 7.33 < 8 \), the interior satisfies \( x + 2y \le 8 \). Both boundary lines form the upper boundary of the feasible region (the region is below both lines), so both inequalities use \( \le \). Therefore the constraints are \( x + y \le 5 \), \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \), which matches option (A).

Answer: Option (A): \( x + y \le 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \)

Example 2

Question: The feasible region of a linear programming problem is an unbounded region in the first quadrant with corner points at \( (0, 6) \) and \( (3, 0) \). The boundary lines passing through these intercepts are \( 2x + y = 6 \) and \( x + 3y = 9 \), and the feasible region extends away from the origin. Which of the following represents the correct set of constraints? (A) \( 2x + y \le 6,\; x + 3y \le 9,\; x \ge 0,\; y \ge 0 \) (B) \( 2x + y \ge 6,\; x + 3y \le 9,\; x \ge 0,\; y \ge 0 \) (C) \( 2x + y \ge 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \) (D) \( 2x + y \le 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \)

Solution: We are told the feasible region is unbounded and lies away from the origin (i.e., on the far side of both boundary lines from the origin). The boundary lines are \( 2x + y = 6 \) and \( x + 3y = 9 \). The corner points are \( (0, 6) \) (on \( 2x + y = 6 \)) and \( (3, 0) \) (on \( 2x + y = 6 \)). Since the region extends away from the origin, test the origin \( (0, 0) \) to determine which side the feasible region is NOT on. Test \( (0,0) \) in \( 2x + y \): \[ 2(0) + 0 = 0 \] Since \( 0 < 6 \), the origin satisfies \( 2x + y < 6 \). The feasible region (away from origin) satisfies \( 2x + y \ge 6 \). Test \( (0,0) \) in \( x + 3y \): \[ 0 + 3(0) = 0 \] Since \( 0 < 9 \), the origin satisfies \( x + 3y < 9 \). The feasible region (away from origin) satisfies \( x + 3y \ge 9 \). Verify with a point clearly in the feasible region, say \( (5, 5) \): \[ 2(5) + 5 = 15 \ge 6 \quad \checkmark \] \[ 5 + 3(5) = 20 \ge 9 \quad \checkmark \] Since the region is in the first quadrant, the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \) apply. Therefore the constraints are \( 2x + y \ge 6 \), \( x + 3y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \), which matches option (C).

Answer: Option (C): \( 2x + y \ge 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \)

🎯 Try a Similar Question

Try a Similar Question

Question: The feasible region of a linear programming problem is bounded by the lines \( 2x + y = 6 \) and \( x + y = 5 \), lies in the first quadrant, and is the region that does NOT contain the origin. Which of the following sets of constraints correctly describes this feasible region? (A) \( 2x + y \le 6,\; x + y \le 5,\; x \ge 0,\; y \ge 0 \) (B) \( 2x + y \ge 6,\; x + y \le 5,\; x \ge 0,\; y \ge 0 \) (C) \( 2x + y \le 6,\; x + y \ge 5,\; x \ge 0,\; y \ge 0 \) (D) \( 2x + y \ge 6,\; x + y \ge 5,\; x \ge 0,\; y \ge 0 \)

Solution

  1. Step 1: Identify the boundary lines and their intercepts: The two boundary lines are \( 2x + y = 6 \) and \( x + y = 5 \). For \( 2x + y = 6 \): x-intercept is \( (3, 0) \) and y-intercept is \( (0, 6) \). For \( x + y = 5 \): x-intercept is \( (5, 0) \) and y-intercept is \( (0, 5) \).
  2. Step 2: Find the intersection point of the two boundary lines: Solving \( 2x + y = 6 \) and \( x + y = 5 \) simultaneously: Subtracting the second from the first: \( (2x + y) - (x + y) = 6 - 5 \), which gives \( x = 1 \). Substituting back: \( 1 + y = 5 \), so \( y = 4 \). The two lines intersect at \( (1, 4) \).
  3. Step 3: Test the origin against each constraint option: Since the feasible region does NOT contain the origin, substituting \( (0, 0) \) must VIOLATE the constraints. Test \( (0,0) \) in \( 2x + y \ge 6 \): \( 2(0) + 0 = 0 \ge 6 \) is FALSE. So the origin does NOT satisfy this inequality — correct, since the region excludes the origin. Test \( (0,0) \) in \( x + y \ge 5 \): \( 0 + 0 = 0 \ge 5 \) is FALSE. So the origin does NOT satisfy this inequality either — again consistent with the region excluding the origin.
  4. Step 4: Verify with a point known to be inside the feasible region: The intersection point \( (1, 4) \) lies on both boundary lines and is in the first quadrant. A point clearly inside the region (on the side away from the origin) could be, for example, \( (2, 4) \). Check \( 2x + y \ge 6 \): \( 2(2) + 4 = 8 \ge 6 \) is TRUE. Check \( x + y \ge 5 \): \( 2 + 4 = 6 \ge 5 \) is TRUE. Check \( x \ge 0 \): \( 2 \ge 0 \) is TRUE. Check \( y \ge 0 \): \( 4 \ge 0 \) is TRUE. All four constraints in option (D) are satisfied by this interior point.
  5. Step 5: Eliminate the other options: Option (A) uses \( 2x + y \le 6 \) and \( x + y \le 5 \), which includes the origin (since \( 0 \le 6 \) and \( 0 \le 5 \)) — this contradicts the given condition. Option (B) uses \( x + y \le 5 \), which is satisfied by the origin — contradiction. Option (C) uses \( 2x + y \le 6 \), which is satisfied by the origin — contradiction. Only Option (D) has BOTH inequalities excluding the origin and placing the feasible region in the first quadrant away from the origin.
  6. Step 6: State the conclusion: The correct set of constraints is Option (D): \( 2x + y \ge 6,\; x + y \ge 5,\; x \ge 0,\; y \ge 0 \).

Answer: Option (D): \( 2x + y \ge 6,\; x + y \ge 5,\; x \ge 0,\; y \ge 0 \).

Everything you get with Solver7

More questions in Linear Programming