Let x 1 , x 2 , . . . , x 9 be non-negative reals such that x 1 + x 2 + ⋯ + x 9 = 1 0 and x 1 + 2 x 2 + ⋯ + 9 x 9 = 1 8 .
Find the sum of the minimum and maximum values of ( 1 0 2 − 9 2 ) x 1 + ( 1 0 2 − 8 2 ) x 2 + ⋯ + ( 1 0 2 − 1 2 ) x 9 .
Bonus: Generalize!
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
newbie question - if i understood well u showed that the maximum and minimum are received when only 2 variables are non-zero, but isnt that case outside the domain P u defined for F(x)? i mean F(x) is undefined for vectors with only 2 variables who are non-zeros. wouldnt it make so that u found the supermum and infimum for F(P) but F(P) doesnt have min and max values?
Log in to reply
The domain includes points where some of the x i are zero (that is why P is closed and bounded, so compact, and hence why the continuous function F achieves its minimum and maximum on P . Since F is a polynomial function of x 1 , x 2 , . . . , x 9 , there are no points where F fails to be defined and continuous. I think you are reading non-negative (i.e. ≥ 0 ) as positive (i.e. > 0 ). Since non-negative includes zero, there is no problem here.
Log in to reply
oh shit, i should read the question next time i guess :) thanks for responding
Problem Loading...
Note Loading...
Set Loading...
Consider linear functions f , g , F on R 9 defined by f ( x ) = j = 1 ∑ 9 x j g ( x ) = j = 1 ∑ 9 j x j F ( x ) = 1 0 0 f ( x ) − j = 1 ∑ 9 ( 1 0 − j ) 2 x j We are interested in finding the extreme values of F over the domain P , where P = { x ∈ R 9 : f ( x ) = 1 0 , g ( x ) = 1 8 , x 1 , x 2 , x 3 , . . . , x 9 ≥ 0 } Since F is continuous and P is compact, F is bounded and achieves its bounds on P . Let the maximum and minimum values of F over P be M and m respectively.
If x ∈ P then x 2 + 2 x 3 + 3 x 4 + ⋯ + 8 x 9 = 1 8 − 1 0 = 8 , and so 8 + x 1 = x 1 + x 2 + 2 x 3 + ⋯ + 8 x 9 ≥ f ( x ) = 1 0 8 + 8 x 1 = 8 x 1 + x 2 + 2 x 3 + ⋯ + 8 x 9 ≤ 8 f ( x ) = 8 0 Thus 2 ≤ x 1 ≤ 9 .
If x ∈ P and there exist 2 ≤ u < v ≤ 9 such that x u , x v > 0 , consider the vector y ∈ R 9 defined by y j = ⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ v − u 1 − v u − 1 0 j = 1 j = u j = v o . w . Then f ( y ) = g ( y ) = 0 , while F ( y ) = − ( v − u ) ( u − 1 ) ( v − 1 ) < 0 . Since x 1 , x u , x v are all positive, it follows that there exists δ > 0 such that x + λ y belongs to P for ∣ λ ∣ < δ . Since F ( x + λ y ) = F ( x ) + λ F ( y ) , we deduce that F ( x + λ y ) < F ( x ) for all 0 < λ < δ , while F ( x + λ y ) > F ( x ) for all − δ < λ < 0 . Thus F ( x ) can be neither m nor M .
It is not possible for any x ∈ P to have x 1 as the only nonzero component. Thus, if x ∈ P is such that F ( x ) is either m or M , then there must exist some 2 ≤ u ≤ 9 such that x u > 0 , but that x 1 and x u are the only nonzero components of x . This means that x 1 = 1 0 − u − 1 8 x u = u − 1 8 and so F ( x ) = 1 0 0 × 1 0 − { 9 2 ( 1 0 − u − 1 8 ) + ( 1 0 − u ) 2 u − 1 8 } = 3 4 2 − 8 u after some simplification. Thus m must be the smallest of these values, and M must be the largest. Hence m = 3 4 2 − 8 × 9 = 2 7 0 M = 3 4 2 − 8 × 2 = 3 2 6 and so the sum of m and M is 2 7 0 + 3 2 6 = 5 9 6 .