The functions used for this problem are simplified functions:
I have a function $g(x)=x_1^2$ and I have a function $h(x,b)=x+b$ and the Area (let's say in the interval x=[0,5]) between these two functions should be minimized while
constraint: the line represented by the function $h(x)$ must always be a minimum of $1$ unit under/away from g(x).
So looking at the point x=[0,0], the value $b$ in function $h(x)$ must be smaller or equal to $-1$.
In now need to setup the constraint as a mathematical inequation $j(x,b)\leqq1$ but I don't really know how this is done. I only know that the function $j(x,y)$ needs to calculate the distance between the two functions and I already read on the internet about it but the people suggested that the distance is calculated like this:
That doesn't really make sense for me since in this equation only the vertical distance is being considered. Does someone have any other suggestions (or clarifications)?