SOLVER7 Study. Nothing Else.
2024 Board Paper Q19

Assertion (A) : The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of \(Z = x + 2y\) occurs at infinite points. Reason (R) : The optimal solution of an LPP with a bounded feasible region must occur at the corner points.
(A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
(B) Both the Assertion (A) and the Reason (R) are true, but the Reason (R) is not the correct explanation of the Assertion (A).
(C) The assertion (A) is true, but the reason (R) is false.
(D) The assertion (A) is false, but the reason (R) is true.

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are finding the best spot in a garden to pick the most flowers. The garden has corners, and the best spots are always at the corners. Sometimes two corners have the same best score. When that happens, every spot along the path between those two corners is equally great. Here, two corners both give the highest score of 120. So the maximum happens at many points, not just one. That is exactly what the Reason explains, making both the Assertion and the Reason true.

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

📖 LPP: Maximum Value at Infinite Points

Detailed Explanation

In Linear Programming, the feasible region is the shaded area satisfying all constraints. A key theorem states that for a bounded feasible region, the objective function \( Z \) always attains its maximum and minimum values at the corner (vertex) points. Sometimes the maximum value is attained at TWO adjacent corner points. When this happens, every point on the line segment joining those two corner points also gives the same maximum value. This means \( Z \) is maximum at infinitely many points. From the figure, the corner points of the shaded bounded region are \( P(60,0) \), \( Q(120,0) \), \( R(60,30) \) and \( S(40,20) \). We evaluate \( Z = x + 2y \) at each corner and check where the maximum occurs.

Formula Used

\( Z = x + 2y \); the optimum of an LPP over a bounded region occurs at a corner point; if two corner points give the same optimum, the whole segment joining them is optimal.

Solution

  1. Step 1: Identify the corner points of the shaded bounded feasible region from the figure. They are \( P(60,0) \), \( Q(120,0) \), \( R(60,30) \) and \( S(40,20) \).
  2. Step 2: Evaluate \( Z = x + 2y \) at each corner point. At \( P(60,0) \): \[ Z = 60 + 2(0) = 60 \] At \( Q(120,0) \): \[ Z = 120 + 2(0) = 120 \]
  3. Step 3: Continue evaluating. At \( R(60,30) \): \[ Z = 60 + 2(30) = 60 + 60 = 120 \] At \( S(40,20) \): \[ Z = 40 + 2(20) = 40 + 40 = 80 \]
  4. Step 4: Compare the values: \( Z(P) = 60 \), \( Z(Q) = 120 \), \( Z(R) = 120 \), \( Z(S) = 80 \). The maximum value \( 120 \) is attained at TWO corner points \( Q(120,0) \) and \( R(60,30) \).
  5. Step 5: Since the maximum occurs at two distinct corner points, every point on the line segment joining \( Q(120,0) \) and \( R(60,30) \) gives the same value \( Z = 120 \). Hence the maximum value occurs at infinitely many points. Therefore Assertion (A) is TRUE.
  6. Step 6: Reason (R) states that the optimal solution of an LPP with a bounded feasible region must occur at the corner points. This is a standard, correct theorem, so Reason (R) is TRUE. Moreover, it is precisely because \( Z \) attains its maximum at two corner points that all points on the joining segment become optimal. Thus (R) correctly explains why the maximum occurs at infinite points.

Final Answer

Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

Common Mistake

A common mistake is checking only one or two corner points and concluding the maximum is unique. Students must evaluate \( Z \) at ALL corner points; if the maximum repeats at two adjacent corners, the entire segment joining them is optimal, giving infinitely many optimal points.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read the corner points of the shaded bounded feasible region from the figure. The four vertices are \( P(60,\,0) \), \( Q(120,\,0) \), \( R(60,\,30) \), and \( S(40,\,20) \). — Reason: By the Corner-Point Theorem, we only need to check the objective function at these vertices; no interior point can give a larger (or smaller) value than the best corner.
  2. Step 2: Evaluate \( Z = x + 2y \) at \( P(60,\,0) \): \[ Z_P = 60 + 2(0) = 60 \] — Reason: Substituting the coordinates of \( P \) directly into the objective function gives its value at this vertex.
  3. Step 3: Evaluate \( Z = x + 2y \) at \( Q(120,\,0) \): \[ Z_Q = 120 + 2(0) = 120 \] — Reason: Substituting the coordinates of \( Q \) gives the objective function value at this vertex.
  4. Step 4: Evaluate \( Z = x + 2y \) at \( R(60,\,30) \): \[ Z_R = 60 + 2(30) = 60 + 60 = 120 \] — Reason: Substituting the coordinates of \( R \) gives the objective function value at this vertex.
  5. Step 5: Evaluate \( Z = x + 2y \) at \( S(40,\,20) \): \[ Z_S = 40 + 2(20) = 40 + 40 = 80 \] — Reason: Substituting the coordinates of \( S \) completes the corner-point evaluation table.
  6. Step 6: Compare all four values: \( Z_P = 60 \), \( Z_Q = 120 \), \( Z_R = 120 \), \( Z_S = 80 \). The maximum value is \( 120 \), and it is achieved at two adjacent corner points \( Q(120,\,0) \) and \( R(60,\,30) \). — Reason: Identifying that the maximum is shared by two adjacent vertices is the key observation needed to verify both the Assertion and the Reason.
  7. Step 7: Because two adjacent corner points \( Q \) and \( R \) both yield \( Z = 120 \), every point on the line segment \( QR \) also gives \( Z = 120 \) (since \( Z \) is linear and equals \( 120 \) at both endpoints). This means the maximum is attained at infinitely many points, confirming the Assertion (A). The theorem that guarantees this behaviour is precisely the Reason (R), so (R) correctly explains (A). — Reason: A linear function that agrees at two points on a segment agrees at every point of that segment; this is why the Reason is the correct explanation of the Assertion.

Final Answer

Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

Common Mistake

One common mistake: students check whether the Assertion and Reason are individually true but forget to verify whether (R) actually explains (A). Here (R) — the theorem about the entire segment being optimal when two adjacent corners share the maximum — is exactly what logically guarantees the infinitely many optimal points described in (A), so (R) is the correct explanation, not merely a related true fact.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points: \( P(60,0) \), \( Q(120,0) \), \( R(60,30) \), \( S(40,20) \).
  2. Step 2: Evaluate \( Z = x + 2y \): \[ Z(P) = 60,\quad Z(Q) = 120 + 0 = 120,\quad Z(R) = 60 + 60 = 120,\quad Z(S) = 40 + 40 = 80 \]
  3. Step 3: Maximum \( Z = 120 \) occurs at both \( Q(120,0) \) and \( R(60,30) \), so \( Z \) is maximum at every point on segment \( QR \), i.e., infinitely many points. Assertion (A) and Reason (R) are both true, and (R) correctly explains (A).

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

➕ More Examples

More Examples

Example 1

Question: Assertion (A): The corner points of the bounded feasible region of an LPP are \( O(0,0) \), \( A(4,0) \), \( B(2,3) \), and \( C(0,3) \). The maximum value of \( Z = 3x + 2y \) occurs at infinitely many points. Reason (R): The maximum value of the objective function of an LPP with a bounded feasible region must occur at at least one of its corner points. (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: Evaluate \( Z = 3x + 2y \) at each corner point. At \( O(0, 0) \): \[ Z = 3(0) + 2(0) = 0 \] At \( A(4, 0) \): \[ Z = 3(4) + 2(0) = 12 \] At \( B(2, 3) \): \[ Z = 3(2) + 2(3) = 6 + 6 = 12 \] At \( C(0, 3) \): \[ Z = 3(0) + 2(3) = 6 \] Step 2: Identify the maximum. The maximum value of \( Z \) is \( 12 \), occurring at both \( A(4,0) \) and \( B(2,3) \). Step 3: Since the maximum is achieved at two adjacent corner points \( A \) and \( B \), it is achieved at every point on the line segment \( AB \). Hence, there are infinitely many optimal solutions. Assertion (A) is TRUE. Step 4: Reason (R) states that the optimal value must occur at at least one corner point for a bounded feasible region. This is a standard theorem and is TRUE. Step 5: However, Reason (R) alone does not explain WHY the maximum occurs at infinitely many points. The explanation for infinitely many solutions is that the objective function has equal values at two adjacent corners — Reason (R) does not capture this. So Reason (R) is NOT the correct explanation of Assertion (A). Answer: Option (B).

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

Example 2

Question: Assertion (A): The corner points of the bounded feasible region of an LPP are \( P(0,5) \), \( Q(3,5) \), \( R(5,2) \), and \( S(0,2) \). The minimum value of \( Z = 2x + 3y \) occurs at a unique point only. Reason (R): The optimal solution of an LPP with a bounded feasible region always occurs at a corner point of the feasible region. (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: Evaluate \( Z = 2x + 3y \) at each corner point. At \( P(0, 5) \): \[ Z = 2(0) + 3(5) = 15 \] At \( Q(3, 5) \): \[ Z = 2(3) + 3(5) = 6 + 15 = 21 \] At \( R(5, 2) \): \[ Z = 2(5) + 3(2) = 10 + 6 = 16 \] At \( S(0, 2) \): \[ Z = 2(0) + 3(2) = 6 \] Step 2: Identify the minimum. The minimum value of \( Z \) is \( 6 \), occurring only at \( S(0,2) \). Step 3: Since the minimum occurs at exactly one corner point and not at two adjacent corners simultaneously, the minimum is unique. Assertion (A) is TRUE. Step 4: Reason (R) states that the optimal solution of an LPP with a bounded feasible region always occurs at a corner point. This is a correct standard theorem and is TRUE. Step 5: In this case, the minimum does occur at a unique corner point \( S(0,2) \), and Reason (R) correctly identifies that optimality is achieved at a corner — which directly supports why the unique minimum is at \( S \). Hence, Reason (R) IS the correct explanation of Assertion (A). Answer: Option (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): The corner points of the bounded feasible region of a Linear Programming Problem are \( O(0,0) \), \( A(4,0) \), \( B(2,3) \), and \( C(0,5) \). The minimum value of \( Z = 3x + 2y \) does NOT occur at infinitely many points — it occurs only at a unique corner point. Reason (R): The optimal solution of a Linear Programming Problem with a bounded feasible region always occurs at a corner point, but if two adjacent corner points yield the same optimal value, there are infinitely many optimal solutions along the segment joining them. (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: Evaluate Z at each corner point: The objective function is \( Z = 3x + 2y \). Compute its value at each corner point. At \( O(0,0) \): \[ Z = 3(0) + 2(0) = 0 \] At \( A(4,0) \): \[ Z = 3(4) + 2(0) = 12 \] At \( B(2,3) \): \[ Z = 3(2) + 2(3) = 6 + 6 = 12 \] At \( C(0,5) \): \[ Z = 3(0) + 2(5) = 10 \]
  2. Step 2: Identify the minimum value: Comparing all values: \( Z = 0, 12, 12, 10 \). The minimum value of \( Z \) is \( 0 \), occurring only at \( O(0,0) \). So the minimum is unique — it does NOT occur at infinitely many points. This confirms Assertion (A) is TRUE.
  3. Step 3: Check for infinitely many minimum solutions: Since only one corner point \( O(0,0) \) gives the minimum \( Z = 0 \), no two adjacent corner points share the minimum value. Hence, the minimum occurs at exactly one point, not infinitely many. Assertion (A) is TRUE.
  4. Step 4: Evaluate the Reason (R): Reason (R) states that the optimal solution always occurs at a corner point (true by the Corner Point Theorem), and if two adjacent corner points give the same optimal value, infinitely many optimal solutions exist along the segment between them. This is a correct and complete statement — Reason (R) is TRUE.
  5. Step 5: Check whether Reason (R) explains Assertion (A): Assertion (A) says the minimum is unique (not infinitely many). Reason (R) explains the general condition under which infinitely many optimal solutions arise (equal values at two adjacent corners). However, Assertion (A) is about the minimum, while the maximum values at \( A \) and \( B \) are both \( 12 \) — meaning the MAXIMUM actually has infinitely many solutions, but the MINIMUM does not. Reason (R) correctly explains the general principle, but it does not directly explain why the minimum in Assertion (A) is unique. Therefore, Reason (R) is true but is NOT the correct explanation of Assertion (A).
  6. Step 6: Choose the correct option: Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). The correct answer is Option (B).

Answer: Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A). The correct option is (B).

Everything you get with Solver7

More questions in Linear Programming