The solution to the given problem involves understanding the concepts of Linear Programming Problems (LPP) and feasible regions.
Assertion (A): Every point of the feasible region of a Linear Programming Problem is an optimal solution.
The feasible region of an LPP is the set of all points that satisfy the constraints of the problem. However, for an LPP, the optimal solution does not occur at every point within this region. Instead, it is typically found at the vertices, or corner points, of the feasible region. Therefore, the assertion that every point is an optimal solution is incorrect.
Reason (R): The optimal solution for a Linear Programming Problem exists only at one or more corner point(s) of the feasible region.
This statement is true. In the context of LPPs, according to the "Fundamental Theorem of Linear Programming," if there exists an optimal solution, it will occur at one of the corner points (vertices) of the feasible region. Therefore, this reason accurately describes where optimal solutions are located within the feasible region.
Upon examination:
The correct option is: Assertion (A) is false but Reason (R) is true.
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.
In a Linear Programming Problem (LPP), the objective function $Z = 2x + 5y$ is to be maximized under the following constraints: 
\[ x + y \leq 4, \quad 3x + 3y \geq 18, \quad x, y \geq 0. \] Study the graph and select the correct option.