MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

4 edited title

# Convex upper bound on a linear-fractional functionsfunction

3 added 106 characters in body

I have a function of the form $f(x,y) = \frac{x}{c+y}$ where $c$ is a positive constantand , $d c \ge x \ge 0$, and $y \ge 0$. I would like to find a convex upper-bound for this function. Is there a principled way for doing this? How about if the upper-bound has to be convex and piecewise linear? Is there a way to find the optimal upper-bound in terms of the number of linear pieces?

Update: Sorry I changed the boundary conditions on $x$ and $y$ so it suits my problem better.

2 deleted 9 characters in body

I have a function of the form $f(x,y) = \frac{x}{c+y}$ where $c$ is a positive constant and $d \ge x, y \ge 0$. I would like to find a convex upper-bound for this function. Is there a principled way for doing this? How about if the upper-bound has to be convex and piecewise linear? Is there a way to find the optimal upper-bound in terms of the number of piecewise linear termspieces?

1