Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Define the function $$ f(a,b,c,\alpha,\beta,\gamma,x) = \max\!\bigg(0 , \, \max\!\big( \left(a+x\right)\alpha,\left(b+x\right)\beta \big) - \left(c+x\right)\gamma\bigg), $$ where $$ a,b,c,\alpha, \beta, \gamma, x \in \left[0, M \right]. $$

Is it true that for any $$ \xi = \left( a,b,c,\alpha, \beta, \gamma \right), $$ the maximum of $f(\xi,\cdot)$ occurs either when $x=0$ or $x=M$?

I think the answer is yes, but I have trouble prooving it.
My argument is as follows:
Given any $\xi$, $f(\xi,c)$ will be $$ f(\xi,x) = \begin{cases} 0 & \text{case A} \\ (a+x)\alpha - (c+x)\gamma & \text{case B}\\ (b+x)\beta - (c+x)\gamma & \text{case C}\\ \end{cases} $$ Hence, $f(\xi,x)$ is a linear function of $x$ in all three cases, and the result follows.
I think this argument works only if each case is independent of $x$, but this is not the case.
As, when $\xi$ is given, judiciously choosing $x$ may put $f$ in another case.

What would be a right way to prove this result?

share|cite|improve this question

migrated from Feb 4 '14 at 18:30

This question came from our site for professional mathematicians.

up vote 3 down vote accepted

It appears that $f$ is a concatenation of convex functions (namely "max" and linear operations), and therefore $f$ is convex. It follows that one of the end points will always be maximal.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.