Confirming your payment

Skip to content

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

The feasible region R of a linear programming problem is given by x - y 1 , x - y 3 , x 0 , y 0 .

Question 721 markHard

The feasible region RR of a linear programming problem is given by x−y≥1x - y \ge 1, x−y≤3x - y \le 3, x≥0x \ge 0, y≥0y \ge 0. It is unbounded.

Assertion (A): No objective function Z=ax+byZ = ax + by, with aa and bb not both zero, can have both a maximum value and a minimum value on RR.

Reason (R): If the feasible region is unbounded, a maximum or a minimum value of ZZ may not exist; if it exists, it must occur at a corner point of the 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.