The following problem <munder> <mo movablelimits="true" form="prefix">max <mrow cla

Kassandra Ross

Kassandra Ross

Answered question

2022-06-23

The following problem
max x , y f ( x , y ) = log x + log ( x + y ) 2 x 3 y
subject to x 0 , y 0

is a concave maximization problem, and thus can be numerically solved by convex optimization methods. The optimal solution may be ( x , y ) = ( 1 , 0 ).

However, I want to derive the solution analytically. I tried the following approach, for example, by taking partial derivative,
f x = 1 x + 1 x + y 2
f x = 1 x + y 3
And there exists no solution that makes both partial derivative to be 0.

Answer & Explanation

feaguelaBapzo

feaguelaBapzo

Beginner2022-06-24Added 9 answers

What you need for optimisation under constraints are the Karush-Kuhn-Tucker conditions, which, for your problem can be written as
L x ( x , y , μ ) = 0 L y ( x , y , μ ) = 0 x > 0 , y 0 , μ 0 y μ = 0   ,
where   L   is given by
L ( x , y , μ ) = f ( x , y ) + μ y   .
With   L   thus defined, we have
L x ( x , y , μ ) = 1 x + 1 x + y 2 = 0 L x ( x , y , μ ) = 1 x + y 3 + μ = 0 .  
From this, bit of elementary algebra gives
x = 1 μ 1   ,
which implies   μ > 1  , since   x > 0  , and hence   y = 0  , from the condition   μ y = 0  . Substituting   y = 0   in the first of the above conditions then gives   x = 1  , and thence,   μ = 2  .

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?