-1
$\begingroup$

What is the minimum for this function of $x_1,x_2, \ldots, x_n$:

$$\sum_{i=1}^n c_i \log x_i + \lambda \; \sum_{i=1}^n d_i x_i, $$ where $\lambda$, $c$ and $d$ series are positive constants, $x_i \in (0.02,1]$ and $\sum x_i = 1$.

  • 0
    how about letting any $x_i \to 0$, then your function goes to $-\infty$, so it does not have a minimum (assuming that the corresponding $c_i > 0$.2010-11-06
  • 0
    Forgot to add.. $x_i \epsilon (0,1]$2010-11-06
  • 2
    A minimum, many minima.2010-11-06
  • 1
    Another way of saying Slowsolver's comment: you have a ceiling, but certainly no floor.2010-11-06
  • 0
    Right. its a concave function and so the minima is $-\infty$. I am thinking about adding some bounds and constraints. Something like $x_i \epsilon (0.02,1]$ and $\sum x_i = 1$.2010-11-06
  • 0
    For the "in" operator, use `\in`, not `\epsilon`. (Also what's up with the ugly sans-serif math font, did I miss something?)2011-01-05

1 Answers 1

1

Let $ x_i=1/m $ certainly $ x_i \in (0,1] $ for all $i$ and all natural numbers $m$. Then your function becomes $-\log m \sum_{i=1}^{n}{c_i} + \frac{\lambda}{m} (\sum_{i=1}^{n}{d_i})$ which can be written as $-m A + B/m $ where $A,B$ are positive constants. This can be made arbitrarily large and negative, so there is no minimum. If this is part of some work on Lagrangian multipliers you need to think again about your restrictions on $\lambda$.

  • 0
    Actually $\lambda$ is just a weight constant. Will the above bounds make any difference?2010-11-06
  • 1
    Firstly what is the nature of this problem (i.e. why can you change the bounds?) Secondly using an open interval for your bounds on the xi means that any minimum is unlikely to be attained.2010-11-06
  • 0
    The larger problem I am trying to solve is http://math.stackexchange.com/questions/8046/optimization-of-relative-entropy . I am fine with assuming the bounds on xi, since the minimum is going to be constrained by the bounds instead of going to $-infty$. The tricky part though is getting the minimum while making sure that $\sum x_i = 1$, otherwise I can take all $x_i$ to be 0.02 and that will result in minimum value for this function. I hope I am not just talking nonsense. Please correct me, if I am. Thanks.2010-11-07
  • 0
    I stated this question in a slightly different way here http://math.stackexchange.com/questions/9277/minimum-for-this-function2010-11-07