Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 71 of 80

Consider the linear programming problem: maximise Z = x + 2y subject to x + y 9 , 2x + y 14 , x + 3y 21 , x 0 , y 0 .

Question 711 markHard

Consider the linear programming problem: maximise Z=x+2yZ = x + 2y subject to x+y≤9x + y \le 9, 2x+y≤142x + y \le 14, x+3y≤21x + 3y \le 21, x≥0x \ge 0, y≥0y \ge 0.

Assertion (A): Deleting the constraint 2x+y≤142x + y \le 14 from the problem does not change the maximum value of ZZ.

Reason (R): Every corner point of the feasible region obtained after deleting this constraint, except one, is also a corner point of the original region, and at that one new corner ZZ is smaller than the original 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.