I am looking for the name of the following problem:
Imagine having a function $f(t)$, which basically resembles the maximum weight from the Knapsack problem for each t (although for what I try to do I just want to be close to f(t) don't have to stay below). Now I have a set of other functions $g_i(t)$, which are basically the items I would like to store in my backpack. With my $g_i(t)$ I would like to come as close to $f(t)$ as possible at each time t and I can shift my $g_i(t)$ along the x-axis. I tried to come up with a problem formulation:
$$min \space \space z = \mid\int_a^b f(t) - \sum_{i=1}^n g_i^{'}(t) x_i\,dt \mid$$
$x_i \in \{0, 1\}$, I think those are not really necessary as I could also choose $\tau_i > b$ instead of $x_i = 0$
$g_i^{'} = g_i(t-\tau_i)$, here $\tau_i$ is the shift on the x-axis. \
I don't need a solution for the problem, I just can't find its name and hence no literature to refer to. So if anyone knows a name or sth that is close I would really appreciate some hints.
Thank you very much