I have following optimization problem:
max $t\log(1+x) : t \land x$ are variables.
I know that we can approximate $\log(1+x)$ by DC programming or Geometric programming and make the optimization problem to be convex, but in my case, I have another variable $t$ multiplying with $\log(1+x)$, how can I make my problem to be convex?
Thanks in advance.