Confirming your payment

Skip to content

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

For a linear programming problem with feasible region R , the objective function Z = ax + by , where a > 0 and b > 0…

Question 801 markHard

For a linear programming problem with feasible region RR, the objective function Z=ax+byZ = ax + by, where a>0a > 0 and b>0b > 0, attains its maximum value on RR at both (2,3)(2, 3) and (6,1)(6, 1).

Assertion (A): ZZ also attains its maximum value on RR at the point (3,3)(3, 3).

Reason (R): If ZZ attains its maximum value at two points of the feasible region, then it attains the same maximum value at every point of the line 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.