Assertion $(A) :$ Consider a Linear Programming Problem with minimise $Z = x + 2y$ subject to constraints $2x + y \geq 3, x + 2y \geq 6, x, y \geq 0$ which gives minimum $Z$ at infinitely many points. The corner points of feasible region are $(0, 3)$ and $(6, 0)$. Reason $(R) :$ If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.