For the linear programming problem(LPP), (A) The given LPP has unbounded feasible region. Choose the correct answer from the options given below: |
(A), (B) and (D) only (A), (B) and (C) only (A) and (B) only (C) and (D) only |
(A) and (B) only |
The correct answer is Option (3) → (A) and (B) only Given LPP: Maximize $Z=4x+y$ Subject to $x+y\le5,\;3x+y\le9,\;x\ge0,\;y\ge0$ Feasible region is bounded, so (A) is false. So corner points are $(0,0),(0,5),(2,3),(3,0)$. Given (B) lists $(3,2)$ instead of $(2,3)$, so (B) is false. Compute $Z$ at corners: $Z(0,0)=0$ $Z(0,5)=5$ $Z(2,3)=11$ $Z(3,0)=12$ Maximum value is $12$ at $(3,0)$, so (C) is true. Only one point gives maximum, so (D) is true. final answer: $\text{(A) and (B)}$ |