List-I | List-II |
(A) Absolute maximum value | (I) 3 |
(B) Absolute minimum value | (II) 0 |
(C) Point of maxima | (III) -5 |
(D) Point of minima | (IV) 4 |
Assertion (A): The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP).
Reason (R): The region representing \( Z = 50x + 70y \) such that \( Z < 380 \) does not have any point common with the feasible region.