Let
$$f(x) := \frac{2x+1}{x^2+3}$$
I would like to solve the following optimization problem
$$ \begin{array}{ll} \underset {x_1, x_2, x_3} {\text{minimize}} & f(x_1) + f(x_2) + f(x_3) \\ \text{subject to} & x_1 + x_2 + x_3 = 3 \\ & x_1, x_2, x_3 \in [0,3] \end{array} $$
I am not sure how to find that since $f(x)$ is concave and convex over the given interval. Any help will be greatly appreciated.
We have, for all $x \in [0, 3]$, $$\frac{2x + 1}{x^2 + 3} - \frac{x + 4}{12} = \frac{x(x + 7)(3 - x)}{12(x^2 + 3)} \ge 0.$$
Thus, we have, for all $x_1, x_2, x_3 \in [0, 3]$ with $x_1 + x_2 + x_3 = 3$, $$f(x_1) + f(x_2) + f(x_3) \ge \frac{x_1 + 4}{12} + \frac{x_2 + 4}{12} + \frac{x_3 + 4}{12} = \frac54$$ with equality if $x_1 = 0, x_2 = 0, x_3 = 3$ and permutations.
Thus, the minimum if $\frac54$.