Finding minimum $\frac{c_1x + c_2y}{x+y}$ I am looking for a good strategy to tackle this non-linear, non-convex optimization problem: 

Minimize $$\frac{c_1x + c_2 y}{x+y}$$

such that: 

$x, y &gt; 0$

$x + y \leq c_3$

$c_1, c_2, c_3$ are given

$c_3 &gt; 0$

Does anyone have any suggestions?

I know this objective function is non-convex, but I was wondering if there were any smart ways to find (or at least approximate) the global optimum. If you suggest an approximation algorithm, please also share its approximation factor. Computational efficiency is not a major concern for me, but accuracy is. 

Currently, my leading (though inelegant) idea is to fix the value of $x + y$ and iterate through possible combinations. In the context of my problem, it is an OK assumption to say there are a finite number of meaningful combinations of $x + y$, so I could conceivable iterate through them, but this would be very inefficient. 

In case it helps, there is the option for the additional constraint that $c_1, c_2 &gt; 0$, but it's preferable to retain the freedom for them to be either positive or negative.

Thanks in advance for your help.
Hint: for any $\forall x,y \gt 0$: $$\min(c_1,c_2) \le \frac{c_1x + c_2 y}{x+y} \le \max(c_1,c_2)$$
The bounds are asymptotically approached when $y \to 0$ and $x \to 0$ respectively, but never attained unless $c_1=c_2\,$.
\begin{eqnarray}
\inf_{x&gt;0,y&gt;0, x+y \le c_3} { c_1 x + c_2 y \over x+y } &amp;=&amp; \inf_{r \in (0,c_3]} \inf_{x&gt;0,y&gt;0, x+y = r} { c_1 x + c_2 y \over x+y } \\
&amp;=&amp; \inf_{r \in (0,c_3]} \inf_{x&gt;0,y&gt;0, x+y = r} { c_1 x + c_2 y \over r } \\
&amp;=&amp; \inf_{r \in (0,c_3]} \min_{x\ge 0,y \ge 0, x+y = r} { c_1 x + c_2 y \over r } \\
&amp;=&amp; \inf_{r \in (0,c_3]} \min(c_1,c_2) \\
&amp;=&amp; \min(c_1,c_2) \\
\end{eqnarray}
The fourth line follows because the minimisation of a linear functional
over the convex hull of a finite number of points (in this case, $(r,0), (0,r)$)
can be replaced by the minimisation over those points.