We study the problem of maximizing XOS functions, which are functions that can be written as a maximum of linear functions. The number of linear functions is known as the width.
We show that the threshold inapproximability is $\Theta(n/\log n)$ in the general case, and $k-1$ for width $k$ XOS functions (where $k \geq 2$).