There's a paper of Evertse, Gyory, Stewart, and Tijdeman in which they prove that for "most" (in an appropriate sense) $a,b\in K$, the equation $ax+by=1$ has at most 2 soutions in units $x,y\in\mathcal{O}_K^*$. The proof is to assume that there are 3 solutions $(x_i,y_i)$, $1\le i\le 3$, use those three equations to eliminate $a$ and $b$, yielding a sum of units that are products of the $x_i$ and $y_i$. Then results of Schlickewei, Evertse, ... (which are based on Schmidt's subspace theorem) imply that there are only finitely many solutions in which no subsum vanishes. It remains to untangle what happens if some subsum does vanish, which isn't so bad for $ax+by=1$, but becomes combinatorially very complicated when there are more variables. In any case, this gives you an idea of how one attacks this sort of problem, where one wants to know that most choices of coefficients give few solutions in units.

Addendum: First, as GH noted, Gyory has 100+ papers, not 1000+ (162 at current MathSciNet count). Second, I tracked down the references:

*MR0939471* Evertse, J.-H.; Győry, K.; Stewart, C. L.; Tijdeman, R., On S-unit equations in two unknowns., *Invent. Math.* **92** (1988), no. 3, 461–477.

The generalization to $n$ variables is the following:

*MR2093164* Evertse, Jan-Hendrik, Linear equations with unknowns from a multiplicative group whose solutions lie in a small number of subspaces. *Indag. Math.* (N.S.) **15** (2004), no. 3, 347–355.

The conclusion of the paper is that for most choices of coefficients, the solutions in units lie in at most $2^n$ proper linear subspaces of $K^n$.