It's well-known that exponential growth eventually overtakes linear (and indeed polynomial) growth (see e.g. here).
Given $a,b,c>0$, I would like to find bounds $t^*=t^*(a,b,c)$ such that \begin{align*} t \geq t^* \Rightarrow at+b \leq \exp(ct), \end{align*} i.e. bounds on the `moment' that the exponential (with rate c) overtakes the (affine) linear function $at+b$. (To be precise, in my case even $c\geq1$ holds, since actually $c=\ln 2$).
A very similar question was asked (and answered) here. There, the search was for bounds on $t$ such that \begin{align*} t \geq t^* \Rightarrow 1+t+\frac{t^2}{2!}+\ldots \frac{t^d}{d!}≤e^{ct} \end{align*} (naturally, $c < 1$) and a very clever use of the Poisson-distribution and Markov-inequality gave \begin{align*} t \ge \dfrac{2 d \ln(2/c)}{c} \end{align*} as a bound. This method can easily be adapted to my case, if we use \begin{align*} at+b \leq \max\{a,b\}t+\max\{a,b\}=\max\{a,b\}(1+t)\leq\exp(ct) \end{align*} and use it to prove the second inequality. For $c \geq 1$ this yields for example \begin{align*} t \geq \frac{\ln (\max\{a,b\})}{c-1}. \end{align*} However, I wonder if it is possible to find abound, that depends more explicitly on $a$ and $b$. In my case, $a$ is rather small especially compared to $b$, so considering the $\max$ of the two as the linear growth factor seems to 'waste' a lot.
Any ideas and comments are appreciated!