This is an attempt to answer the second version of the question with $f: [0, 1] \rightarrow {\mathbb R}^n$.
If $f$ is piecewise constant, i.e.~if $f$ takes only $N$
values ${V}_{1} , \cdots , {V}_{N}$, let ${m}_{k}$ be the measure
of ${f}^{{-1}} ({V}_{k})$, then obviously for any subset $A$, the
function $f \left(t\right) {{\chi}}_{A} \left(t\right)$ will take the same values, and one has
$$\int_{A}^{}f d t = \sum _{i = 1}^{N} {{\alpha}}_{k} {V}_{k}$$
where ${{\alpha}}_{k} \in \left[0 , {m}_{k}\right]$. Every such sum is reachable,
so that the reachable set is the convex set
$$C = \left\{\sum _{i = 1}^{N} {{\alpha}}_{k} {V}_{k} , \quad \forall k , {{\alpha}}_{k} \in \left[0 , {m}_{k}\right]\right\}\qquad (1)$$
For non piecewise constant function, one could build an approximation of the
reachable set by the following construction: partition ${\mathbb{R}}^{n}$ in a sequence
of disjoint cubes of side ${\epsilon}$
$${\mathbb{R}}^{n} = \bigcup_{j \in \mathbb{N}} {K}_{j}^{{\epsilon}}$$
and let ${V}_{j}^{{\epsilon}}$ be the center of the cube ${K}_{j}^{{\epsilon}}$.
We approximate $f$ by a piecewise constant function ${f}_{{\epsilon}}$ by
defining
$${f}_{{\epsilon}} \left(t\right) = {V}_{j}^{\epsilon} \quad \text{if} \ f \left(t\right) \in {K}_{j}^{{\epsilon}}$$
Then formula (1) defines a convex set ${C}^{{\epsilon}}$ approximating the set $C$
of reachable values.
This proof is not complete of course, it remains to prove some kind of convergence
result for the obtained family ${C}^{{\epsilon}}$.
We need to find a set $C_\alpha$ s.t. $\int_C f = \alpha \int_A f + (1-\alpha)\int_B f$
We choose $C=(A\cap B) \cup A_\alpha \cup B_{1-\alpha}$ Where $A_\alpha$ and $B_{1-\alpha}$ are such that $\int_{A_\alpha} f = \alpha\int_{A-B} f$ and $\int_{B_{1-\alpha}} f = (1-\alpha)\int_{B-A} f$.
There are a couple details that need to be taken care of but that's the jist of it. – Kitegi Aug 31 '17 at 18:21