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).