SOLVER7 Study. Nothing Else.
2026 Board Paper Q20

Assertion (A) : Consider a Linear Programming Problem with minimise \(Z = x + 2y\) subject to constraints \(2x + y \ge 3, x + 2y \ge 6,\) \(x, y \ge 0\) which gives minimum \(Z\) at infinitely many points. The corner points of feasible region are \((0, 3)\) and \((6, 0).\) Reason (R) : If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are looking for the cheapest way to buy fruits from a shop with certain rules. Sometimes two different shopping choices cost exactly the same. When that happens, any mix between those two choices also costs the same amount. Here, the smallest possible value of the cost formula turns out to be 6. Both the statement and its reason are true, and the reason perfectly explains why the statement is correct.

Answer: Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The minimum value is \( Z = 6 \), achieved at every point on the segment joining \( (0, 3) \) and \( (6, 0) \).

📖 LPP with Multiple Optimal Solutions: Assertion-Reason

Detailed Explanation

In Linear Programming, we optimise an objective function \( Z \) over a feasible region formed by constraints. The optimal value always occurs at a corner point of the feasible region. However, a special situation arises when two different corner points give the SAME optimal value of \( Z \). In that case, every point on the line segment joining those two corner points also gives that same optimal value, so the problem has infinitely many optimal solutions. This happens when the objective function line is parallel to the boundary line joining those two corner points. To answer an Assertion-Reason question, we must independently check whether the Assertion is true, whether the Reason is true, and whether the Reason correctly explains the Assertion.

Formula Used

Objective function: \( Z = x + 2y \). Corner Point Method: evaluate \( Z \) at each corner point of the feasible region; the smallest value is the minimum. Multiple optimal solutions occur when two corner points give equal optimal \( Z \).

Solution

  1. Step 1: Write the given constraints. We must minimise \( Z = x + 2y \) subject to \( 2x + y \ge 3 \), \( x + 2y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \).
  2. Step 2: Find where the two boundary lines meet the axes. For \( x + 2y = 6 \): when \( x = 0 \), \( y = 3 \), giving \( (0, 3) \); when \( y = 0 \), \( x = 6 \), giving \( (6, 0) \). We test whether these points satisfy the other constraint \( 2x + y \ge 3 \).
  3. Step 3: Check \( (0, 3) \) in \( 2x + y \ge 3 \): \( 2(0) + 3 = 3 \ge 3 \), which holds. Check \( (6, 0) \): \( 2(6) + 0 = 12 \ge 3 \), which also holds. Both are also non-negative, so \( (0, 3) \) and \( (6, 0) \) are valid corner points of the feasible region.
  4. Step 4: Evaluate \( Z = x + 2y \) at these corner points. At \( (0, 3) \): \[ Z = 0 + 2(3) = 6. \] At \( (6, 0) \): \[ Z = 6 + 2(0) = 6. \] Both corner points give the same value \( Z = 6 \).
  5. Step 5: Since two corner points produce the same minimum value \( Z = 6 \), the objective function line \( x + 2y = 6 \) is parallel to the boundary line \( x + 2y = 6 \) joining them (they are, in fact, the same line here). Therefore every point on the segment joining \( (0, 3) \) and \( (6, 0) \) gives \( Z = 6 \), so the minimum occurs at infinitely many points. Hence the Assertion is TRUE.
  6. Step 6: The Reason states a general fact: if two corner points give the same optimal value, then every point on the segment joining them gives that same value. This is a correct and standard result in LPP. So the Reason is TRUE, and it precisely explains WHY the Assertion holds (infinitely many optimal points).
  7. Step 7: Both Assertion and Reason are true, and the Reason correctly explains the Assertion. Therefore the correct choice is (A).

Final Answer

Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The minimum value is \( Z = 6 \), achieved at every point on the segment joining \( (0, 3) \) and \( (6, 0) \).

Common Mistake

A common mistake is to assume that an LPP always has a unique optimal solution at a single corner point. Students forget that when two corner points give equal optimal \( Z \), the entire line segment between them is optimal, giving infinitely many solutions.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the problem: We need to minimise \( Z = x + 2y \) subject to the constraints \( 2x + y \ge 3 \), \( x + 2y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \). — Reason: Clearly identifying the objective function and all constraints lets us set up the feasible region correctly before doing any calculations.
  2. Step 2: Find the boundary intercepts of \( x + 2y = 6 \): Set \( x = 0 \) to get \( 2y = 6 \), so \( y = 3 \), giving the point \( (0, 3) \). Then set \( y = 0 \) to get \( x = 6 \), giving the point \( (6, 0) \). — Reason: Axis intercepts are quick to find and are usually the corner points of the feasible region for problems like this.
  3. Step 3: Verify that both intercepts satisfy all constraints: Check \( (0, 3) \) in \( 2x + y \ge 3 \): we get \( 2(0) + 3 = 3 \ge 3 \). This holds. Check \( (6, 0) \) in \( 2x + y \ge 3 \): we get \( 2(6) + 0 = 12 \ge 3 \). This also holds. Both points lie on the boundary \( x + 2y = 6 \) and satisfy \( x \ge 0 \), \( y \ge 0 \). — Reason: A point is a valid corner of the feasible region only if it satisfies every constraint; we must always check before using it.
  4. Step 4: Evaluate \( Z \) at the corner points: At \( (0, 3) \): \( Z = 0 + 2(3) = 6 \). At \( (6, 0) \): \( Z = 6 + 2(0) = 6 \). Both corners give the same value \( Z = 6 \). — Reason: The corner point method guarantees that the optimal value of a linear objective function occurs at a corner (vertex) of the feasible region, so we evaluate \( Z \) there.
  5. Step 5: Check whether \( Z = 6 \) is truly the minimum: The feasible region extends to infinity (the constraints are of the \( \ge \) type), so \( Z \) can become arbitrarily large, but the smallest value at any corner is \( 6 \). There is no corner that gives a value smaller than \( 6 \). Hence the minimum is \( Z = 6 \). — Reason: For a minimisation problem over an unbounded feasible region, we must confirm that no other direction of the region yields a smaller \( Z \).
  6. Step 6: Identify infinitely many solutions: Since both \( (0, 3) \) and \( (6, 0) \) give \( Z = 6 \), and these two points lie on the boundary line \( x + 2y = 6 \), every point on the segment joining \( (0, 3) \) and \( (6, 0) \) also satisfies \( Z = x + 2y = 6 \). This means the objective function line \( x + 2y = 6 \) is parallel to (in fact, coincident with) the boundary constraint \( x + 2y = 6 \). — Reason: When the objective function is parallel to a binding constraint edge, every point on that edge is equally optimal, producing infinitely many optimal solutions.
  7. Step 7: Evaluate the Assertion and the Reason: Assertion (A) states that the minimum of \( Z = x + 2y \) subject to \( x + 2y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \) is \( 6 \) and is achieved at infinitely many points. This is TRUE, as shown above. Reason (R) states that when two corner points give the same optimal value, every point on the segment joining them is also optimal. This is TRUE and is precisely the theorem that explains why the Assertion holds. — Reason: For an Assertion-Reason question, we must judge the truth of each statement independently and then decide whether R logically explains A.

Final Answer

Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The minimum value is \( Z = 6 \), achieved at every point on the segment joining \( (0, 3) \) and \( (6, 0) \).

Common Mistake

One common mistake: Students often check only one of the two boundary-line intercepts and conclude there is a unique minimum. Always evaluate \( Z \) at ALL corner points — if two corners give the same optimal value, the solution is not unique but consists of the entire line segment between them.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Minimise \( Z = x + 2y \) subject to \( x + 2y \ge 6 \), \( 2x + y \ge 3 \), \( x \ge 0 \), \( y \ge 0 \). Corner points of feasible region from \( x + 2y = 6 \): \( (0, 3) \) and \( (6, 0) \).
  2. Step 2: Evaluate \( Z \) at corner points: At \( (0, 3) \): \( Z = 0 + 2(3) = 6 \). At \( (6, 0) \): \( Z = 6 + 2(0) = 6 \). Both give \( Z = 6 \).
  3. Step 3: Since both corners yield equal minimum \( Z = 6 \), every point on the segment joining \( (0, 3) \) and \( (6, 0) \) is also optimal. The objective function line \( x + 2y = 6 \) is parallel to (in fact coincides with) the boundary \( x + 2y = 6 \), confirming Reason (R) correctly explains Assertion (A).

Answer: Option (A): Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The minimum value is \( Z = 6 \), achieved at every point on the segment joining \( (0, 3) \) and \( (6, 0) \).

➕ More Examples

More Examples

Example 1

Question: Assertion (A): For the Linear Programming Problem — Minimise \( Z = 3x + 3y \) subject to the constraints \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), \( x, y \ge 0 \) — the minimum value of \( Z \) occurs at infinitely many points. The corner points of the feasible region are \( (0, 4) \) and \( (4, 0) \). Reason (R): If the objective function gives equal values at two corner points of the feasible region, then every point on the line segment joining those two corner points also gives the same optimal value. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1: Identify the feasible region. The constraints are \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), and \( x, y \ge 0 \). The feasible region is unbounded (above and to the right of the boundary lines). Step 2: Find the corner points. For \( x + 2y = 4 \): when \( x = 0 \), \( y = 2 \); when \( y = 0 \), \( x = 4 \). For \( 2x + y = 4 \): when \( x = 0 \), \( y = 4 \); when \( y = 0 \), \( x = 2 \). Intersection of the two lines: solving \( x + 2y = 4 \) and \( 2x + y = 4 \) simultaneously gives \( x = \frac{4}{3} \), \( y = \frac{4}{3} \). So the corner points of the feasible region are \( \left(\frac{4}{3}, \frac{4}{3}\right) \), \( (0, 4) \), and \( (4, 0) \). The Assertion states only \( (0, 4) \) and \( (4, 0) \) are corner points — this omits \( \left(\frac{4}{3}, \frac{4}{3}\right) \), so Assertion (A) is partially incorrect in describing the corner points. Step 3: Evaluate Z at the correct corner points. At \( \left(\frac{4}{3}, \frac{4}{3}\right) \): \[ Z = 3 \cdot \frac{4}{3} + 3 \cdot \frac{4}{3} = 4 + 4 = 8 \] At \( (0, 4) \): \[ Z = 3(0) + 3(4) = 12 \] At \( (4, 0) \): \[ Z = 3(4) + 3(0) = 12 \] Step 4: Identify the minimum. The minimum value of \( Z \) is \( 8 \), attained at the single corner point \( \left(\frac{4}{3}, \frac{4}{3}\right) \). Hence the minimum does NOT occur at infinitely many points; Assertion (A) is FALSE. Step 5: Verify Reason (R). Reason (R) is a standard, well-known result in Linear Programming: if two corner points yield the same optimal value, every point on the joining segment is also optimal. This is TRUE. Conclusion: Assertion (A) is false; Reason (R) is true. The answer is (D).

Answer: (D) Assertion (A) is false, but Reason (R) is true.

Example 2

Question: Assertion (A): For the Linear Programming Problem — Maximise \( Z = 2x + 4y \) subject to the constraints \( x + 2y \le 8 \), \( x \le 4 \), \( y \le 3 \), \( x, y \ge 0 \) — the maximum value of \( Z \) is \( 16 \) and it occurs at infinitely many points. The corner points of the feasible region are \( (0, 0) \), \( (4, 0) \), \( (4, 2) \), \( (2, 3) \), and \( (0, 3) \). Reason (R): If the objective function attains the same maximum value at two adjacent corner points of the feasible region, then every point on the line segment joining those two corner points also gives the same maximum value. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1: Find the corner points of the feasible region. The constraints \( x + 2y \le 8 \), \( x \le 4 \), \( y \le 3 \), \( x \ge 0 \), \( y \ge 0 \) form a bounded feasible region. The vertices are found by intersecting boundary lines in pairs: \( (0, 0) \) — intersection of \( x = 0 \) and \( y = 0 \). \( (4, 0) \) — intersection of \( x = 4 \) and \( y = 0 \). \( (4, 2) \) — intersection of \( x = 4 \) and \( x + 2y = 8 \): \( 4 + 2y = 8 \Rightarrow y = 2 \). \( (2, 3) \) — intersection of \( y = 3 \) and \( x + 2y = 8 \): \( x + 6 = 8 \Rightarrow x = 2 \). \( (0, 3) \) — intersection of \( x = 0 \) and \( y = 3 \). So the corner points are \( (0,0) \), \( (4,0) \), \( (4,2) \), \( (2,3) \), \( (0,3) \) — exactly as stated in Assertion (A). This part is correct. Step 2: Evaluate \( Z = 2x + 4y \) at each corner point. At \( (0, 0) \): \[ Z = 2(0) + 4(0) = 0 \] At \( (4, 0) \): \[ Z = 2(4) + 4(0) = 8 \] At \( (4, 2) \): \[ Z = 2(4) + 4(2) = 8 + 8 = 16 \] At \( (2, 3) \): \[ Z = 2(2) + 4(3) = 4 + 12 = 16 \] At \( (0, 3) \): \[ Z = 2(0) + 4(3) = 12 \] Step 3: Identify the maximum. The maximum value is \( Z = 16 \), attained at both \( (4, 2) \) and \( (2, 3) \). Since two adjacent corner points give the same maximum, by Reason (R), every point on the segment joining \( (4, 2) \) and \( (2, 3) \) also gives \( Z = 16 \). Hence there are infinitely many optimal points. Assertion (A) is TRUE. Step 4: Verify Reason (R). Reason (R) correctly states the standard LP result: equal optimal values at two corner points imply every point on the joining segment is also optimal. Reason (R) is TRUE. Step 5: Check if Reason (R) correctly explains Assertion (A). Yes — the reason that the maximum occurs at infinitely many points is precisely because two corner points \( (4, 2) \) and \( (2, 3) \) both give \( Z = 16 \), and by Reason (R), the entire segment between them is optimal. Reason (R) is the correct explanation of Assertion (A). Conclusion: Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The answer is (A).

Answer: (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).

🎯 Try a Similar Question

Try a Similar Question

Question: Assertion (A): Consider a Linear Programming Problem with minimise \( Z = 2x + y \) subject to the constraints \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), \( x, y \ge 0 \). The minimum value of \( Z \) is achieved at infinitely many points, and the corner points of the feasible region are \( (0, 4) \) and \( (4, 0) \). \nReason (R): If the objective function produces the same minimum value at two corner points of the feasible region, then every point on the line segment joining those two corner points will also yield the same minimum value. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution

  1. Step 1: Identify the feasible region: The constraints are \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), and \( x, y \ge 0 \). The feasible region is the set of all points satisfying all these constraints simultaneously, which lies above and to the right of the boundary lines.
  2. Step 2: Find the corner points: Find intersection points of the boundary lines with the axes and with each other. \nLine 1: \( x + 2y = 4 \) meets the y-axis at \( (0, 2) \) and the x-axis at \( (4, 0) \). \nLine 2: \( 2x + y = 4 \) meets the y-axis at \( (0, 4) \) and the x-axis at \( (2, 0) \). \nIntersection of Line 1 and Line 2: Solve \( x + 2y = 4 \) and \( 2x + y = 4 \). Subtracting the first from twice the second: \( 3x = 4 \), so \( x = \frac{4}{3} \), \( y = \frac{4}{3} \). This gives the interior corner point \( \left(\frac{4}{3}, \frac{4}{3}\right) \). \nHowever, we must check which vertices actually bound the feasible region. The feasible region is unbounded (extends to infinity), and its corner points are \( (0, 4) \), \( \left(\frac{4}{3}, \frac{4}{3}\right) \), and \( (2, 0) \). Note that \( (4, 0) \) lies on Line 1 but not on the boundary of the feasible region's vertex set in the same way.
  3. Step 3: Re-examine the corner points carefully: For the feasible region defined by \( x + 2y \ge 4 \), \( 2x + y \ge 4 \), \( x \ge 0 \), \( y \ge 0 \): \nThe boundary of the feasible region has vertices at: - Intersection of \( x + 2y = 4 \) with the y-axis (\( x = 0 \)): \( (0, 2) \). Check \( 2(0) + 2 = 2 \ge 4 \)? No, so \( (0, 2) \) does NOT satisfy \( 2x + y \ge 4 \). - Intersection of \( 2x + y = 4 \) with the y-axis: \( (0, 4) \). Check \( 0 + 2(4) = 8 \ge 4 \)? Yes. So \( (0, 4) \) is a corner point. - Intersection of \( 2x + y = 4 \) with the x-axis: \( (2, 0) \). Check \( 2 + 2(0) = 2 \ge 4 \)? No. So \( (2, 0) \) does NOT satisfy \( x + 2y \ge 4 \). - Intersection of \( x + 2y = 4 \) with the x-axis: \( (4, 0) \). Check \( 2(4) + 0 = 8 \ge 4 \)? Yes. So \( (4, 0) \) is a corner point. - Intersection of both lines: \( \left(\frac{4}{3}, \frac{4}{3}\right) \) is a corner point. \nSo the corner points are \( (0, 4) \), \( \left(\frac{4}{3}, \frac{4}{3}\right) \), and \( (4, 0) \).
  4. Step 4: Evaluate Z at each corner point: The objective function is \( Z = 2x + y \). \nAt \( (0, 4) \): \( Z = 2(0) + 4 = 4 \). \nAt \( \left(\frac{4}{3}, \frac{4}{3}\right) \): \( Z = 2\left(\frac{4}{3}\right) + \frac{4}{3} = \frac{8}{3} + \frac{4}{3} = \frac{12}{3} = 4 \). \nAt \( (4, 0) \): \( Z = 2(4) + 0 = 8 \).
  5. Step 5: Determine the minimum and check for infinitely many solutions: The minimum value of \( Z \) is \( 4 \), achieved at both \( (0, 4) \) and \( \left(\frac{4}{3}, \frac{4}{3}\right) \). Since two distinct corner points give the same minimum value, every point on the segment joining them also gives \( Z = 4 \), resulting in infinitely many optimal points. \nHowever, the Assertion states the corner points are \( (0, 4) \) and \( (4, 0) \). At \( (4, 0) \), \( Z = 8 \ne 4 \). So the claim that minimum \( Z \) occurs at \( (4, 0) \) is incorrect; the minimum actually occurs at \( (0, 4) \) and \( \left(\frac{4}{3}, \frac{4}{3}\right) \). \nThus, the Assertion (A) is FALSE (it incorrectly names \( (4, 0) \) as a point where minimum is achieved), while Reason (R) is a standard, correct theorem about linear programming.
  6. Step 6: Choose the correct option: Since Assertion (A) is false (wrong corner points stated for minimum) but Reason (R) is true (the theorem about infinitely many optimal solutions is correct), the answer is Option (D).

Answer: Option (D): Assertion (A) is false, but Reason (R) is true. The minimum value of \( Z = 2x + y \) is \( 4 \), achieved at \( (0, 4) \) and \( \left(\frac{4}{3}, \frac{4}{3}\right) \), not at \( (4, 0) \) as stated in Assertion (A). Reason (R) correctly states the theorem about infinitely many optimal solutions.

Everything you get with Solver7

More questions in Linear Programming