I have become interested in constrained relations among simple cyclic sums involving three positive variables. By simple, I mean so simple that they are also fully symmetric. The "building blocks" of the constraints and relations I have been looking at are: $$ \sum_{\mbox{cyc}} 1 \equiv 3 \\ \sum_{\mbox{cyc}} a \\ \sum_{\mbox{cyc}} ab \\ \sum_{\mbox{cyc}} a^2 \\ \sum_{\mbox{cyc}} 1/a \\ \sum_{\mbox{cyc}} abc \equiv 3abc \\ $$ So an easy sample would be that $$\frac{\sum_{\mbox{cyc}} abc}{\sum_{\mbox{cyc}} a^2} \leq 1$$
The first really tough one I have encountered is:
If $a$, $b$ and $c$ are positives and $a+b+c=3$, show that: $$a^2+b^2+c^2 \leq (27-15\sqrt{3})\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)$$
I got to this while trying to prove that if $a+b+c=3$ then $a^2+b^2+c^2 \leq 1/a+1/b+1/c$; that turns out to be untrue, but only by a little bit ($27-15\sqrt{3}\approx 1.019)$.
You might show this using BW, but I would hope to find something easier to follow.
EDIT
The maximum ratio is $(27-15\sqrt{3})$ and it occurs at
$$
\left(a = \sqrt{3}, b=c= \frac{3-\sqrt{3}}{2}\right)
$$
and at the two other cyclic permutations of that point.