Replacing x=y in i) and ii), we get f(2x)=4f(x), ∀x∈R+. Therefore, by induction, we can prove that
f(2nx)=4nf(x),∀n∈Z+,x∈R+.
Now, by substituting y=2x in i) and ii), we get 10f(x)≤f(3x)≤9f(x), ∀x∈R+. It follows that f(x)≤0,∀x∈R+. Therefore, from ii), we have
xyf(x+y)≤(x+y)yf(x)≤xyf(x),
or
f(x+y)≤f(x),∀x,y∈R+.
Next, we rewrite the condition ii) as
x+yf(x+y)≤xf(x)+yf(y).
By substituting y=2x,3x,…,nx(n∈Z+), we can prove by induction that
f(nx)≤n2f(x),∀n∈Z+,x∈R+.(*)
From these inequalities, we get
x2nf(x)=2nxf(2nx)=(2n−n)x+nxf((2n−n)x+nx)≤(2n−n)xf((2n−n)x)+nxf(nx)≤x(2n−n)f(x)+xnf(x)=x2nf(x)
for any positive integer n and any positive real number x. Therefore, the equality cases in (*) must hold, i.e.
f(nx)=n2f(x),∀n∈Z+,x∈R+.
From this, we can easily prove that f(x)=kx2,∀x∈Q+ (where k=f(1), and k≤0). And then, by combining this result with f(x+y)≤f(x),∀x,y>0, we conclude that f(x)=kx2,∀x∈R+.
It is easy to check that this function satisfy the given conditions.