I'm facing this problem: <mstyle mathsize="1.2em"> <munder> <mo movablelimits="tr

Patatiniuh

Patatiniuh

Answered question

2022-07-08

I'm facing this problem:
min x R + 3 max { i = 1 3 x i 2 2 x 1 x 3 ( i = 1 3 x i ) 2 , i = 1 3 x i 2 + 2 ( x 1 x 3 x 1 x 2 + x 2 x 3 ) ( i = 1 3 x i ) 2 }
I don't know how to deal with inner max and choose one of two!

I'm trying to use m a x ( A , B ) 1 2 ( A + B )! Do you have any idea?

Answer & Explanation

Tristin Case

Tristin Case

Beginner2022-07-09Added 15 answers

A standard trick when dealing with max-min or min-max problem is to introduce a new decision variable, call it z, which models the inner optimization. Hence, your objective function becomes
min z R , x R + 3 z
with the following constraints
z i = 1 3 x i 2 2 x 1 x 3 ( i = 1 3 x i ) 2 z i = 1 3 x i 2 + 2 ( x 1 x 3 x 1 x 2 + x 2 x 3 ) ( i = 1 3 x i ) 2 i = 1 3 x i = 1
The first two inequalities model the max expression, i.e. they state that whatever z comes out to be, it has to be larger than either of the two terms. The last one captures the homogeneity, as it has been pointed out in the comments. From here, you can apply the KKT conditions.

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?