I am trying to solve an optimization problem that contains power functions. I reformulated the problem via a logarithmic function, and it works well. The terms of the problem involved are similar to $\log(x) = y$ where $(x, y) \in \mathbb{R}$. Now, I would like to reformulate the mentioned term as its equivalent, conic programming. A wise man said the term is non-convex itself, and I need to relax it and use an exponential cone. However, I am unsure how I can represent that. Also, the main part of the optimization model would be:
\begin{align} &\text{Max}_{(x,y)} \ = \frac{y}{x} \\ &s.t:\\ & \log (x) = y \\ & x, y \in \mathbb{R} \\ \end{align}
logterm. – A.Omidi Oct 26 '25 at 12:31