Step 1: In a Linear Programming Problem (LPP), if the objective function \( Z = ax + by \) has the same value at two corner points of the feasible region, then the maximum value of \( Z \) will occur at all points on the line segment joining these two corner points.
Step 2: Since the line segment contains infinitely many points, the number of points at which \( Z \) attains its maximum value is infinite.
If vector \( \mathbf{a} = 3 \hat{i} + 2 \hat{j} - \hat{k} \) \text{ and } \( \mathbf{b} = \hat{i} - \hat{j} + \hat{k} \), then which of the following is correct?