0

I am trying to minimize a log function of 3 variables

$f(x,y,z) = a\log(x)+b\log(y)+c\log(z)$

such that $x+y+z=k$ for some constant $k$.

for $a,b,c > 0$ and $x,y,z > 1$

Now $f(x,y,z)$ is concave so Lagrangian method won't work to minimize. Any pointers on how to solve it? Also are there any standard programming libraries which can solve this?

Thanks!

aniket
  • 3

1 Answers1

0

We will assume k > 3. f(x,y,z) = alogx + blogy + clogz = $log(x^ay^bz^c)$ Thinking geometrically, $(x^ay^bz^c)$ is the volume of a box with sides $x^a,y^b,z^c$. We know that this volume is maximized by take the 3 sides equal. Its minimum would be zero if we could take one side to be 0, but since x,y,z >1 we cannot do that. The best we can do is to take two sides as small as possible.

One of a, b, c, is smallest. Without loss of generality, suppose that is a. Then we can take y = z = 1 and x = k - 2, making $y^b$ and $z^c$ sides as small as possible, specificially 1.

Then f(x,y,z) = alog(k-2) and this should be your minimum.

Betty Mock
  • 3,532