Question #41770

This question tests the 'Multiple Optimal Solutions' concept in Linear Programming, masked by 'Domain Constraint Intersections' of inverse trigonometric functions.

Students often mistakenly assume $\sec^{-1}(u)$ implies $|u| \le 1$, leading to an unbounded region $|x+y| \ge 4$ (Unbounded Region Trap).

Furthermore, the square root over $\sin^{-1}(x-y)$ restricts its argument to $[0, 1]$ rather than $[-1, 1]$.

Missing this yields a false segment length of $\sqrt{2}$.

Finally, because the objective function is parallel to the boundary $x+y=4$, the maximum is attained along a segment rather than a single vertex, punishing students who only check corner points and assume a unique solution (length 0).