Edit: question has been changed from 'lexicographic' (cf. "D K"'s answer below) to 'degree' minimality.

Let $x_1,x_2,x_3$ be indeterminates. Fix an integer $k> 3$. Consider the set $M$ of all monomials of the form $x_1^{i_1}.x_2^{i_2}.x_3^{i_3}$ where each $i_j\in \mathbb{N}$ with $i_j\geq 1$ and $i_1+i_2+i_3 = k$.

Fix an arbitrary $F\in M$ and write $F = x_1^{a}.x_2^{b}.x_3^{c}$.

**Question** When does there exist a triple $(w_1, w_2, w_3)$, with each $w_i\in \mathbb{N}$ and $w_i\geq 1$, such that $$a.w_1 + b.w_2 + c.w_3 < i_1.w_1 + i_2.w_2 + i_3.w_3, \forall G = x_1^{i_1}.x_2^{i_2}.x_3^{i_3}\in M \;\text{with} \; G\neq F ?$$ In the exponential case, same question replaced by $a^{w_1}+ b^{w_2}+ c^{w_3} < i_1^{w_1}+i_2^{w_2}+ i_3^{w_3}$.

Positive example in additive case: $k = 4$ on three indeterminates. Then if $F$ corresponds to the element of $B_4$ with exponents $(2,1,1)$, then for any $w_2, w_3>1$, $w = (1,w_2,w_3)$ has the desired property.

Sometimes this question has a negative answer: e.g. k=4 on only two indeterminates. if we take F to correspond to the element in $B_4$ with exponents $(2,2)$ then we cannot achieve both $2w_1 + 2w_2 < w_1 + 3 w_2$ and $2w_1+2w_2 < 3w_1+w_2$.

Same question for $n$-variables $x_1,\ldots, x_n$ and $k > n.$

Apologies if this question has been answered; (general and specific) references also appreciated.