4: Extrema Subject to Two Constraints
( \newcommand{\kernel}{\mathrm{null}\,}\)
Here is Theorem [theorem:1] with m=2.
Suppose that n>2. If X0 is a local extreme point of f subject to g1(X)=g2(X)=0 and
|∂g1(X0)∂xr∂g1(X0)∂xs∂g2(X0)∂xr∂g2(X0)∂xs|≠0
for some r and s in {1,2,…,n}, then there are constants λ and μ such that
∂f(X0)∂xi−λ∂g1(X0)∂xi−μ∂g2(X0)∂xi=0,
1≤i≤n.
For notational convenience, let r=1 and s=2. Denote
U=(x3,x4,…xn) and U0=(x30,x30,…xn0).
Since
|∂g1(X0)∂x1∂g1(X0)∂x2∂g2(X0)∂x1∂g2(X0)∂x2|≠0,
the Implicit Function Theorem (Theorem 6.4.1) implies that there are unique continuously differentiable functions
h1=h1(x3,x4,…,xn) and h2=h1(x3,x4,…,xn),
defined on a neighborhood N⊂Rn−2 of U0, such that (h1(U),h2(U),U)∈D for all U∈N, h1(U0)=x10, h2(U0)=x20, and
g1(h1(U),h2(U),U)=g2(h1(U),h2(U),U)=0,U∈N.
From ???, the system
[∂g1(X0)∂x1∂g1(X0)∂x2∂g2(X0)∂x1∂g2(X0)∂x2][λμ]=[fx1(X0)fx2(X0)]
has a unique solution (Theorem 6.1.13). This implies Equation ??? with i=1 and i=2. If 3≤i≤n, then differentiating Equation ??? with respect to xi and recalling that (h1(U0),h2(U0),U0)=X0 yields
∂g1(X0)∂xi+∂g1(X0)∂x1∂h1(U0)∂xi+∂g1(X0)∂x2∂h2(U0)∂xi=0
and
∂g2(X0)∂xi+∂g2(X0)∂x1∂h1(U0)∂xi+∂g2(X0)∂x2∂h2(U0)∂xi=0.
If X0 is a local extreme point of f subject to g1(X)=g2(X)=0, then U0 is an unconstrained local extreme point of f(h1(U),h2(U),U); therefore,
∂f(X0)∂xi+∂f(X0)∂x1∂h1(U0)∂xi+∂f(X0)∂x2∂h2(U0)∂xi=0.
The last three equations imply that
|∂f(X0)∂xi∂f(X0)∂x1∂f(X0)∂x2∂g1(X0)∂xi∂g1(X0)∂x1∂g1(X0)∂x2∂g2(X0)∂xi∂g2(X0)∂x1∂g2(X0)∂x2|=0,
|∂f(X0)∂xi∂g1(X0)∂xi∂g2(X0)∂xi∂f(X0)∂x1∂g1(X0)∂x1∂g2(X0)∂x1∂f(X0)∂x2∂g1(X0)∂x2∂g2(X0)∂x2|=0.
Therefore, there are constants c1, c2, c3, not all zero, such that
[∂f(X0)∂xi∂g1(X0)∂xi∂g2(X0)∂xi∂f(X0)∂x1∂g1(X0)∂x1∂g2(X0)∂x1∂f(X0)∂x2∂g1(X0)∂x2∂g2(X0)∂x2][c1c2c3]=[000].
If c1=0, then
[∂g1(X0)∂x1∂g1(X0)∂x2∂g2(X0)∂x1∂g2(X0)∂x2][c2c3]=[00],
so Equation ??? implies that c2=c3=0; hence, we may assume that c1=1 in a nontrivial solution of Equation ???. Therefore,
[∂f(X0)∂xi∂g1(X0)∂xi∂g2(X0)∂xi∂f(X0)∂x1∂g1(X0)∂x1∂g2(X0)∂x1∂f(X0)∂x2∂g1(X0)∂x2∂g2(X0)∂x2][1c2c3]=[000],
which implies that
[∂g1(X0)∂x1∂g1(X0)∂x2∂g2(X0)∂x1∂g2(X0)∂x2][−c2−c3]=[fx1(X0)fx2(X0)].
Since Equation ??? has only one solution, this implies that c2=−λ and c2=−μ, so Equation ??? becomes
[∂f(X0)∂xi∂g1(X0)∂xi∂g2(X0)∂xi∂f(X0)∂x1∂g1(X0)∂x1∂g2(X0)∂x1∂f(X0)∂x2∂g1(X0)∂x2∂g2(X0)∂x2][1−λ−μ]=[000].
Computing the topmost entry of the vector on the left yields Equation ???.
[example:7]
Minimize
f(x,y,z,w)=x2+y2+z2+w2
subject to
x+y+z+w=10 and x−y+z+3w=6.
Solution
Let
L=x2+y2+z2+w22−λ(x+y+z+w)−μ(x−y+z+3w);
then
Lx=x−λ−μLy=y−λ+μLz=z−λ−μLw=w−λ−3μ,
so
x0=λ+μ,y0=λ−μ,z0=λ+μ,w0=λ+3μ.
This and Equation ??? imply that
(λ+μ)+(λ−μ)+(λ+μ)+(λ+3μ)=10(λ+μ)−(λ−μ)+(λ+μ)+(3λ+9μ)=16.
Therefore,
4λ+14μ=104λ+12μ=16,
so λ=3 and μ=−1/2. Now Equation ??? implies that
(x0,y0,z0,w0)=(52,72,5232).
Since f(x,y,z,w) is the square of the distance from (x,y,z,w) to the origin, it attains a minimum value (but not a maximum value) subject to the constraints; hence the constrained minimum value is
f(52,72,52,32)=27.
[example:8]
The distance between two curves in R2 is the minimum value of
√(x1−x2)2+(y1−y2)2,
where (x1,y1) is on one curve and (x2,y2) is on the other. Find the distance between the ellipse
x2+2y2=1
and the line
x+y=4.
Solution
We must minimize
d2=(x1−x2)2+(y1−y2)2
subject to
x21+2y21=1 and x2+y2=4.
Let
L=(x1−x2)2+(y1−y2)2−λ(x21+2y21)2−μ(x2+y2);
then
Lx1=x1−x2−λx1Ly1=y1−y2−2λy1Lx2=x2−x1−μLy2=y2−y1−μ,
so
x10−x20=λx10\; \quad (i)y10−y20=2λy10\quad (ii)x20−x10=μ\quad \quad \;\;(iii)y20−y10=μ.\quad \quad \;\;(iv)
From (i) and (iii), μ=−λx10; from (ii) and (iv), μ=−2λy10. Since the curves do not intersect, λ≠0, so x10=2y10. Since x210+2y210=1 and (x0,y0) is in the first quadrant,
(x10,y10)=(2√6,1√6).
Now (iii), (iv), and Equation ??? yield the simultaneous system
x20−y20=x10−y10=1√6,x20+y20=4,
so
(x20,y20)=(2+12√6,2−12√6).
From this and Equation ???, the distance between the curves is
[(2+12√6−2√6)2+(2−12√6−1√6)2]1/2=√2(2−32√6).
[theorem:3]