Given that a + b = 1 find the minimum of ( a + a 1 ) 2 + ( b + b 1 ) 2 .
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.
This problem can be done in more than one way. One method would be to use the method of Lagrange multipliers while the other involves converting a multivariable problem to a single-variable problem. Here, the single variable approach is presented. The expression to be minimised is:
y = ( a + a 1 ) 2 + ( b + b 1 ) 2 ⟹ y = ( a + a 1 ) 2 + ( 1 − a + 1 − a 1 ) 2 ∵ a + b = 1
Differentiating y with respect to a , equating the derivative of y to zero, and after simplifying, gives the expression:
a − a 3 1 = ( 1 − a ) − ( 1 − a ) 3 1
Looking at the similarity of the expressions on the left and right side leads to a trivial conclusion (there might be non-trivial conclusions):
a = 1 − a ⟹ a = b ⟹ a = b = 2 1 ∵ a + b = 1
From here, the expression using the computed values evaluates to y m i n = 1 2 . 5 . To be more rigorous, one must carry out the second derivative test to confirm a minimum. This has been left out in this brief solution. This analysis is quite incomplete as it does not consider the existence of multiple local optimum points.
Problem Loading...
Note Loading...
Set Loading...
Expanding the expression, we have:
( a + a 1 ) 2 + ( b + b 1 ) 2 a 2 + b 2 + 4 + a 2 1 + b 2 1 = a 2 + 2 + a 2 1 + b 2 + 2 + b 2 1 ≥ 2 1 ( a + b ) 2 + 4 + 2 1 ( a 1 + b 1 ) 2 = 2 1 + 4 + 2 1 ( a 1 + b 1 ) 2 ≥ 2 1 + 4 + 2 1 ( a + b 4 ) 2 = 2 1 + 4 + 2 1 ( 4 ) 2 = 1 2 . 5 By Titu’s lemma By AM-HM inequality
For both the Titu's lemma and AM-HM inequality cases above, equality occurs when a = b = 2 1 .