The given question is about the properties of solutions in a Linear Programming Problem (LPP). Specifically, it concerns a scenario in which the objective function \(Z = ax + by\) reaches its maximum value at two different corner points.
In Linear Programming, if the maximum value of the objective function occurs at more than one corner point, then it implies that the segment connecting these two corner points is a line segment of the feasible region where the objective function has the same value throughout. This is because the objective function is linear, and linearity implies that any linear combination of points with the same function value will also result in the same function value.
Here's a step-by-step explanation:
Thus, given that the objective function \(Z\) achieves its maximum value at more than one corner, the number of points at which \(Z_{max}\) occurs is indeed infinite. Therefore, the correct answer is Infinity.
Hence, the correct option is Infinity, as none of the other options - 1, 2, or 0 - appropriately reflect the situation described.