Consider maximizing the linear function subject to a linear constraint and a quadratic constraint .
If is the point in space where the function attains its maximum with the given constraints, and is the value of that maximum, then find the value of .
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.
Let us simplify this optimization problem by taking the linear constraint x + 2 y − z = 1 0 ⇒ z = x + 2 y − 1 0 and substituting it into f ( x , y , z ) to become g ( x , y ) = 2 x − 3 y + 5 ( x + 2 y − 1 0 ) = 7 x + 7 y − 5 0 and h ( x , y ) = x 2 + y 2 + ( x + 2 y − 1 0 ) 2 = 1 0 0 .
By taking Lagrange multipliers ( ∇ g = λ ⋅ ∇ h ), we now obtain:
7 = λ ⋅ [ 2 x + 2 ( x + 2 y − 1 0 ) ⋅ 1 ] ;
7 = λ ⋅ [ 2 y + 2 ( x + 2 y − 1 0 ) ⋅ 2 ] ;
or x + ( x + 2 y − 1 0 ) = y + 2 ( x + 2 y − 1 0 ) ⇒ y = 3 1 0 .
Now we solve for x in h ( x , 3 1 0 ) = x 2 + ( 3 1 0 ) 2 + [ x + 2 ( 3 1 0 ) − 1 0 ] 2 = 1 0 0 ;
or x 2 + ( 3 1 0 ) 2 + ( x − 3 1 0 ) 2 = 1 0 0 ;
or 2 x 2 − 3 2 0 x + 9 2 0 0 = 1 0 0 ⇒ 1 8 x 2 − 6 0 x − 7 0 0 = 0 ⇒ x = 3 6 6 0 ± 6 0 2 − 4 ( 1 8 ) ( − 7 0 0 ) ⇒ x = 3 5 ⋅ ( 1 ± 1 5 ) .
Since we wish to maximize g ( x , y ) , we only accept the larger root x = 3 5 ⋅ ( 1 + 1 5 ) . We now solve for z = x + 2 y − 1 0 = 3 5 ⋅ ( 1 + 1 5 ) + 2 ( 3 1 0 ) − 1 0 = 3 5 ⋅ ( − 1 + 1 5 ) and for f ( x , y , z ) = 2 [ 3 5 ⋅ ( 1 + 1 5 ] − 3 ( 3 1 0 ) + 5 [ 3 5 ⋅ ( − 1 + 1 5 ) ] = 3 − 4 5 + 3 5 1 5 . Altogether, our final computation comes to:
x + 2 y + 3 z + f m a x = 3 5 ⋅ ( 1 + 1 5 ) + 2 ( 3 1 0 ) + 3 [ 3 5 ⋅ ( − 1 + 1 5 ) ] + 3 − 4 5 + 3 5 1 5 = 3 5 5 1 5 − 3 5 .