Given
f ( x , y ) = 5 x 2 + 3 x y + 1 0 y 2 + 4 x − 2 0 y + 5 0
Find the the minimum value of f ( x , y ) if ( x , y ) satisfies
x + 2 y = 1 0
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.
Substituting x = 1 0 − 2 y into f ( x , y ) , then simplifying, and then completing the square gives:
5 ( 1 0 − 2 y ) 2 + 3 ( 1 0 − 2 y ) y + 1 0 y 2 + 4 ( 1 0 − 2 y ) − 2 0 y + 5 0 = 2 4 y 2 − 1 9 8 y + 5 9 0 = 2 4 ( y − 8 3 3 ) 2 + 8 1 4 5 3
Since the minimum of a square of a real number is 0 , f ( x , y ) has a minimum of 8 1 4 5 3 = 1 8 1 . 6 2 5 .
Problem Loading...
Note Loading...
Set Loading...
Let:
X = [ x y ]
The optimisation problem can be re-written as follows:
f ( X ) = 0 . 5 X T H X + g T X + C
Subject to:
A X = b
Where:
H = [ 1 0 3 3 2 0 ] f = [ 4 − 2 0 ] A = [ 1 2 ] b = 1 0 C = 5
The matrix H is a positive definite matrix which guarantees the existence of a global minimum to this constrained optimisation problem. This is analogous to the second derivative test in higher dimensions.
Now, the cost function is re-written by introducing a Lagrange multiplier as follows:
F = 0 . 5 X T H X + g T X + C + λ T ( A X − b )
Computing the gradient of F with respect to the vector X and computing it to zero. Here, zero means the null vector where necessary.
∇ F = 0 ⟹ H X + A T λ = − f A X = b
This gives rise to a system of linear equations:
H X + A T λ = − f A X = b
Multiplying the first equation by A H − 1 yields:
A H − 1 H X + A H − 1 A T λ = − A H − 1 f A X + A H − 1 A T λ = − A H − 1 f b + A H − 1 A T λ = − A H − 1 f
∵ A X = b
⟹ λ = − ( A H − 1 A T ) − 1 ( A H − 1 f + b )
Plugging the above result in: H X + A T λ = − f
Gives:
X o p t = H − 1 ( A T ( A H − 1 A T ) − 1 ( A H − 1 f + b ) − f )
Finally, the minimum value of the function is:
f m i n = 0 . 5 X o p t T H X o p t + g T X o p t + C = 1 8 1 . 6 2 5
We can use the final two expression, crunch out the matrix multiplications and find the answer. I did this using a computer, for the sake of convenience. Of course, this can be done easily by hand, but I deliberately chose to demonstrate the linear algebra route to generalise the result for a quadratic problem minimisation subject to any number of linear constraints, in any number of variables.