This may be a simple question, but I'm not sure how to find the algebraic solution for a problem like:
$ax=b+\max(cx,d)$
where $a,b,c$, and $d$ are known.
Wolfram-Alpha is not able to give me a solution (lazy, I know), so is it even possible to solve this type of problem algebraically?
Thank you!
You just have to break it up into cases and the method really depends on the numbers.
You have two cases:
1) $cx \geq d$. In this case $$ a x = b + c x \Rightarrow x = \frac{b}{a-c}, \text{ and } c x= \frac{bc}{a-c} \geq d$$
2) $cx \leq d$. In this case $$ a x = b + d \Rightarrow x = \frac{b+d}{a}, \text{ and } c x= \frac{c(b+d)}{a} \geq d$$
So if $\frac{bc}{a-c} \geq d$ then first case is valid.
If $\frac{c(b+d)}{a} \geq d$ then second case is valid.
If neither condition holds, there is no solution.