WHY no second-derivative test here? Because we have a finite list of candidate points and we just compare actual values. We never need to classify saddle vs. extremum — direct comparison wins.
Find the absolute extrema of f(x,y)=x2−2xy+2y on D={0≤x≤3,0≤y≤2}.
Step 1 — interior.fx=2x−2y=0,fy=−2x+2=0.Why this step? Interior extrema need a flat tangent plane, so set both partials to 0.
From fy: x=1. From fx: y=x=1. Point (1,1) is inside D. ✓
f(1,1)=1−2+2=1.
Step 2 — boundary (4 edges).Why? The fence may hold the extremum even if interior is flat-free.
Top y=2,0≤x≤3: f=x2−4x+4=(x−2)2. Critical x=2: f=0. Ends: f(0,2)=4,f(3,2)=1.
Left x=0,0≤y≤2: f=2y. Ends: f(0,0)=0,f(0,2)=4.
Right x=3,0≤y≤2: f=9−6y+2y=9−4y. Decreasing → ends: f(3,0)=9,f(3,2)=1.
Step 3 — compare. Candidate values: {1,0,9,0,4,0,4,9,1}.
abs max=9 at (3,0);abs min=0 at (0,0) and (2,2).Why this step? We just pick biggest and smallest from the finite candidate list.
Find absolute extrema of f(x,y)=x2+y2−x−y+1 on the disk x2+y2≤1.
Step 1 — interior.fx=2x−1=0⇒x=21,fy=2y−1=0⇒y=21.
Is (21,21) inside? 41+41=21<1 ✓.
f(21,21)=41+41−21−21+1=21.
Step 2 — boundaryx2+y2=1. Substitute x2+y2=1:
f=1−x−y+1=2−(x+y).Why this step? The constraint kills the quadratic terms, leaving a clean linear thing.
Parametrize x=cost,y=sint: f=2−(cost+sint)=2−2sin(t+4π).
Since sin ranges in [−1,1]:
fmaxbdry=2+2(at x=y=−21),fminbdry=2−2.
Imagine a bumpy trampoline stretched over a fenced backyard. You want the highest and lowest points of the trampoline. There are only two kinds of spots that can be highest/lowest: a flat dimple inside the yard, or somewhere along the fence. So you mark all the flat dimples, then walk all the way around the fence marking the bumps there, and finally you stand back and point at the very top and very bottom of everything you marked. Done!
Dekho, idea bahut simple hai. Jab function f(x,y)continuous ho aur region Dclosed aur bounded ho (matlab fence band hai aur infinitely bada nahi hai), to ek absolute maximum aur ek absolute minimum zaroor milega — Extreme Value Theorem guarantee deta hai. Socho ek bumpy chaadar ek fenced maidan ke upar tani hui hai; sabse uncha point aur sabse neecha point kahin na kahin hoga hi.
Ab woh point kahan chhup sakta hai? Sirf do jagah: ya to interior ke andar koi flat dimple (jahan ∇f=0, dono partial derivatives zero), ya phir boundary (fence) pe. Isliye trick yeh hai — pehle andar ke critical points nikaalo (fx=0,fy=0) aur dekho woh region ke andar hain ya nahi. Phir boundary ko ek-ek karke single variable problem bana lo (rectangle ke edges pe substitute karo, ya circle pe x=cost,y=sint daal do) aur uske critical points + corners/endpoints bhi nikaalo. Yeh corner wala part log bhool jaate hain — yahin se marks katte hain!
Last step sabse aasaan: saare candidate points pe f ki value nikaalo aur compare karo. Sabse badi value = absolute max, sabse choti = absolute min. Yahan Hessian / second derivative test ki zaroorat nahi — woh sirf local classification ke liye hota hai. Yahan to seedha values compare karke winner choose kar lete hain. Mnemonic yaad rakho: IBC — Interior, Boundary, Compare. Bas itna hi.