In problems involving multiple constraints, always break down each inequality and plot the corresponding boundary line. Then, determine which side of the line satisfies the inequality. For inequalities of the form \( \geq \) or \( \leq \), the feasible region will be either above or below the line. By identifying where all the constraints overlap, you can determine the feasible region. This approach is commonly used in linear programming problems and geometric optimization tasks.




The solution for the linear programming problem (LPP) requires defining the feasible region. This region is the intersection of the following constraints:
To determine the feasible region, we plot these constraints:
The feasible region is the overlapping area within the first quadrant that satisfies all conditions. It is bounded by the lines \(y = -x + 10\), \(y = -x + 12.5\), the y-axis (\(x = 0\)), and the x-axis (\(y = 0\)). The provided image illustrates this feasible region, showing the area defined by these constraints.
The maximum value of \( Z = 4x + y \) for a L.P.P. whose feasible region is given below is:

Assertion (A): The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of \( Z = x + 2y \) occurs at infinite points.
Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner points.
