The following problem
$\max_{x, y} f(x,y) = \log x + \log (x+y) - 2x -3y$
subject to $x \geq 0, y \geq 0$
is a concave maximization problem, and thus can be numerically solved by convex optimization methods. The optimal solution may be $(x^*, y^*) = (1, 0)$.
However, I want to derive the solution analytically. I tried the following approach, for example, by taking partial derivative,
$\frac{\partial f}{\partial x} = \frac{1}{x} + \frac{1}{x+y} - 2$
$\frac{\partial f}{\partial x} = \frac{1}{x+y} - 3$
And there exists no solution that makes both partial derivative to be $0$.
What you need for optimisation under constraints are the Karush-Kuhn-Tucker conditions, which, for your problem can be written as $$ \frac{\partial\mathcal{L}}{\partial x} \left(x,y,\mu\right)=0\\ \frac{\partial\mathcal{L}}{\partial y} \left(x,y,\mu\right)=0\\ x>0, y\ge0, \mu\ge0\\ y\mu=0\ , $$ where $\ \mathcal{L}\ $ is given by $$ \mathcal{L}\left(x,y,\mu\right)=f(x,y)+\mu y\ . $$ With $\ \mathcal{L}\ $ thus defined, we have \begin{align} \frac{\partial\mathcal{L}}{\partial x} \left(x,y,\mu\right)&=\frac{1}{x} +\frac{1}{x+y}-2=0\\ \frac{\partial\mathcal{L}}{\partial x} \left(x,y,\mu\right)&=\frac{1}{x+y}-3+\mu=0\\ .\ \end{align} From this, bit of elementary algebra gives $$ x=\frac{1}{\mu-1}\ , $$ which implies $\ \mu>1\ $, since $\ x>0\ $, and hence $\ y=0\ $, from the condition $\ \mu y=0\ $. Substituting $\ y=0\ $ in the first of the above conditions then gives $\ x=1\ $, and thence, $\ \mu=2\ $.