I am trying to maximize x+1/y (x \in [0,1] and y\in [1, 6]. Is there a simple formulation to handle this expression?

I also analyzed the Dinkelbach formulation and arrived to an equivalent problem: max xy+1-2ry where r is a convenient parameter updated externally. I tried various manipulations such as (x-2r)y+1 and then use the geometric term for the former term. However, x>2r, and this might not happen. If anybody has ideas I will be glad to consider them.
Cheers

Dear both,
Thank you.
Indeed that is the simple version. In the “real” problem the decision variable is a SD positive matrix (M), x is the maximizer of a concave function of M, say det_rootn(M), and y is the minimizer of a convex function, say trace_inv(M). The goal is finding M that maximizes the combination of both. Graphically, I have evidences that 1/trace_inv(M) is concave, so is the sum of det_rootn(M)+1/trace_inv(M). However, I must say I was not able to prove the generalized concavity of 1/trace_inv(M).
Am I asking too much from CVX? Do you see a way to circumvent the problem? I must say I tried to generate a new function called sym_trace_inv to represent 1/ trace_inv(M) from trace_inv(M) but without success.