x 2 </msup> y &#x2192;<!-- → --> max, such that x 2 </

excluderho

excluderho

Answered question

2022-06-26

x 2 y max,
such that x 2 + 4 x y 1 , x 0 and y 0.

I think I need to use the KKT conditions here. I did however not yet succeed in solving it, so could someone please give me an example of how this should be done? And should I include the constraints x 0 and y 0 into the Lagrangian function?

Answer & Explanation

sleuteleni7

sleuteleni7

Beginner2022-06-27Added 28 answers

The KKT conditions in this case for x , y that are feasible x 0 , y 0 , x 2 + 4 x y 1 is that α , β , γ 0 (feasible dual variables for the constraints in the last parens in respective order) such that

1. Stationary: 2 x y = α + γ ( 2 x + 4 y ), x 2 = β + γ x 2 , and
2. Complementary slackness: α x = β y = γ ( x 2 + 4 x y 1 ) = 0

However, the problem is not convex therefore KKT conditions are not sufficient. In particular, the eigenvalues of the hessian of your objective are y ± 4 x 2 + y 2 so that one of them is always positive (so not concave for a maximization problem) and also one is negative whenever x > 0 which is certainly feasible (so it's not even definite in either direction).

But they are necessary. So you can guess which constraints are active or not and go through all permutations of this to find all KKT-satisfying points. For example, guess that the nonnegativity constraints are slack ( α = β = 0) and that the other constraint is tight ( x 2 + 4 x y = 1). Then plugging this into the KKT conditions we get three equations:
2 x y = γ ( 2 x + 4 y )
( 1 γ ) x 2 = 0
x 2 + 4 x y = 1
Which solve for x = 1 / 3 and y = 1 / 12 and give objective value 1 / 108 . (Hint: this is optimal.)

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?