4.4.15 · D3 · HinglishMultivariable Calculus

Worked examplesLagrange multipliers — one and two constraints

3,582 words16 min read↑ Read in English

4.4.15 · D3 · Maths › Multivariable Calculus › Lagrange multipliers — one and two constraints

Shuru karne se pehle: teen words jo hum baar baar use karenge.


The scenario matrix

Neeche har cell ek alag tarika hai jisme yeh topic kat sakta hai. Har worked example apne cell(s) ka naam leta hai.

# Cell class Kya cheez ise alag banati hai Example
C1 One constraint, dono signs of se max aur min Ex 1
C2 Constraint level + shadow price verify karo , units Ex 2
C3 Degenerate: (singular point) method chupchap ek extremum miss kar deta hai Ex 3
C4 Boundary / product-of-vars, branch us branch ko check karna zaroori hai jo tune divide karke hata di Ex 4
C5 Real-world word problem (economics) words ko mein translate karo; interpret karo Ex 5
C6 Two constraints, two real roots (max & min) do normals ke span mein Ex 6
C7 Two constraints, degenerate: parallel normals jab method toot jaata hai / koi solution nahi Ex 7
C8 Limiting behaviour: constraint inactive ho jaati hai → unconstrained Ex 8
C9 Exam twist: unbounded / no extremum exists Lagrange ek aisa point return karta hai jo curve par saddle hai Ex 9

Ex 1 — Dono signs of (cell C1)

Forecast: andaza lagao ki circle par sabse bada kahan hoga. (Hint: mein ka weight zyada hai.)

Figure s01 (neeche): kali unit circle par char candidate points hain. Red wale maximum hain, kale wale minimum; red arrow upar wale point par dikhata hai jo seedha radius ke saath bahar point kar raha hai — ke parallel — yahi Lagrange condition hai. Dekho ki ka koi sideways (tangential) component nahi wahan.

Figure — Lagrange multipliers — one and two constraints
  1. Gradients likho. , . Yeh step kyun? Lagrange dono arrows compare karta hai; hume unhe explicitly chahiye.
  2. set karo. aur . Kyun? Extremum par ka koi tangential component nahi, isliye woh ke parallel hai.
  3. Har equation dhyan se padho. Pehle se: , isliye ya . Doosre se: , isliye ya . Aisa kyun split karte hain? ya se divide karne par / solutions chup chap chhoot jaate — circle ke wahi poles. Kabhi kisi variable ko divide karke mat hataao bina yeh check kiye ki woh zero ho sakta hai.
  4. Branches enumerate karo.
    • : points , .
    • : points , .
  5. Roles assign karo. ( par) minimum hai; ( par) maximum hai.

Ex 2 — Nonzero constraint level & shadow price (cell C2)

Forecast: sabse kareeb point wahan hoga jahan origin se line par perpendicular pada ho. Calculate karne se pehle andaza lagao.

Figure s02 (neeche): kali line constraint hai. Red arrow origin se sabse chhota raasta hai — yeh line ko right angle par red point par hit karta hai. Woh perpendicularity yahi hai jo yahan force karta hai.

Figure — Lagrange multipliers — one and two constraints
  1. Gradients. , . Kyun? Distance-squared, distance se smoother hai aur uska minimizer same hota hai — differentiate karne ke liye koi square roots nahi.
  2. : , . Isliye , . symbolic kyun rakhein? Hum ko ke function ke roop mein chahte hain taaki shadow-price claim test kar sakein.
  3. Constraint impose karo : . Constraint mein wapas substitute kyun karein? Steps 1–2 sirf answer tak direction fix karte hain (ratio ); constraint hi woh cheez hai jo line par actual location pin karti hai.
  4. Point & value. ko aur mein substitute karo: , isliye . ko mein formula kyun compute karein? Kyunki is cell ka poora point yahi hai ki ko ke respect mein differentiate karein aur se compare karein — formula se yeh possible hota hai.
  5. plug karo: , ; distance . Distance bhi kyun report karein? Original question closest point poochh raha tha, isliye (squared distance) ko actual distance mein translate karte hain.

Ex 3 — Degenerate: ek extremum miss kar deta hai (cell C3)

Forecast: yeh curve ek leftward-pointing spike jaisi lagti hai. sabse chhota kahan hoga? Kya Lagrange ise find kar payega?

Figure s03 (neeche): kali curve cusp hai; kala arrow " decrease karo" direction mein point karta hai. Red dot cusp tip ko mark karta hai jahan curve ka sharp corner hai aur — koi normal arrow draw nahi ho sakta, aur yahi wajah hai ki Lagrange ki equation wahan pahunch nahi sakti.

Figure — Lagrange multipliers — one and two constraints
  1. Gradients. , .
  2. : aur . Doosre se: ya . Lekin pehli equation ko bana deta hai — impossible. Isliye . Yeh kyun matter karta hai? force karta hai , yani point .
  3. Point check karo. par: . Multiplier equation padhi jaaye to koi finite kaam nahi karta. Kyun? Cusp par surface ka koi well-defined normal nahi; exactly woh singular case hai jiske baare mein parent note ne warn kiya tha (Mistake C).
  4. Haath se resolve karo. Curve par , isliye minimized hai par, cusp par. Extremum real hai — Lagrange ki equation bas ise produce nahi kar saki.

Ex 4 — Variables ka product, branch (cell C4)

Forecast: quadrants II/IV mein negative hai, I/III mein positive. Isliye max aur min symmetric values hone chahiye.

  1. Gradients. , .
  2. set karo: , . Kyun? Constrained extremum par ka ellipse ke saath koi tangential component nahi, isliye woh ellipse ke normal ke parallel hona chahiye — wahi parallelism exactly hai.
  3. Unhe multiply karo: . Isliye . Divide kyun nahi, factor kyun? se divide karne par branch chhup jaati hai. Factor karne se dono branches bachti hain.
  4. Branch A: . Tab ; points aur . Yeh saddle-value candidates hain (na max na min).
  5. Branch B: , .
    • : ; constraint , . .
    • : ; same magnitude, .

Ex 5 — Real-world word problem: economics (cell C5)

Forecast: capital 4 guna mehnga hai, to kya firm zyada labour ya capital kharidegi?

  1. Translate karo. Constraint budget level ke saath (poora budget kharcho). Maximize . Poora budget kyun? Output dono inputs mein badhta hai, isliye optimum sab kharach kar deta hai. symbolic kyun rakhein? Hume chahiye ke function ke roop mein taaki interpret kar sakein.
  2. Gradients. , .
  3. Equations. aur .
  4. Dono ko divide karo (dono sides positive hain, isliye safe hai): . Yahan divide kyun? instantly cancel ho jaata hai, inputs ka ratio milta hai — answer ka economic core yahi hai.
  5. Budget ke terms mein: . General kyun solve karein? Taaki optimal-value formula directly agla step mein nikal aaye.
  6. Optimal value ke function ke roop mein. . Kyun? Numbers plug karne se pehle yeh general solution hai; ise differentiate karne par shadow price bina kisi guesswork ke milti hai.
  7. plug karo. , output . Multiplier .

Ex 6 — Do constraints, do real roots (cell C6)

Forecast: intersection ek tilted circle hai. iske upar aur neeche ek highest aur lowest point hit karna chahiye.

Figure s04 (neeche): tilted intersection circle (kala) ka side view. Red dot circle ka top hai, , jahan sabse bada hai; kala dot bottom par, , jahan sabse chhota hai. Ek closed curve par do extremes — isliye hum do real roots expect karte hain.

Figure — Lagrange multipliers — one and two constraints
  1. Gradients. , , .
  2. : . Combination kyun? Intersection curve par, ko do normals ke span (plane) mein lie karna zaroori hai — koi akela normal kaafi nahi.
  3. Pehle do subtract karo: ya . Agar to equation 3 deta hai lekin equations 1,2 dete hain — contradiction. Isliye . Do equations subtract kyun? Dono ke barabar hain, isliye unka difference ek step mein unknown eliminate kar deta hai aur aur ke beech ek clean relation haath mein aa jaata hai — teen variables ko ek ki taraf collapse karne ka sabse tez raasta.
  4. Points find karne ke liye constraints use karo. : . : . Ab kyun laao? Step 3 ne curve par ek direction fix ki; do constraint equations actual points pin karti hain jahan woh direction circle se milti hai.
    • : : point , (minimum).
    • : : point , (maximum).
  5. Multipliers recover karo. lo. Equation 1 se: . Equation 3 mein substitute karo: , phir . ki parwah kyun? Yeh confirm karte hain ki sach mein do normals ke span mein baithta hai (ek valid solution exist karta hai), aur do shadow prices hain — ki sensitivity sphere aur plane ko respectively relax karne ke respect mein.
  6. *Do roots kyun? Tilted circle ka -direction mein ek upar aur ek neeche hota hai; dono signs exactly wahi do points hain — ek max, ek min.

Ex 7 — Do constraints, degenerate parallel normals (cell C7)

Forecast: calculate karne se pehle do planes ko dhyan se dekho.

  1. Constraints padho. . Lekin kehta hai , isliye . Pehle check kyun? Dono planes parallel hain () aur coincide nahi karte — isliye feasible set empty hai.
  2. Gradients se confirm karo. , . Yeh linearly dependent hain (ek doosre ka stretch hai). Fatal kyun? Lagrange ke two-constraint formula ko independent chahiye taaki unka span ek genuine plane ho. Agar woh parallel hain, to "plane" ek single line mein collapse ho jaati hai aur method ki assumption fail ho jaati hai (parent Mistake C, two-constraint version).
  3. Conclusion. Koi feasible point exist nahi karta ⇒ koi extremum nahi. Lagrange sahi taur par koi solution produce karne se mana kar deta hai.

Ex 8 — Limiting behaviour : constraint inactive ho jaati hai (cell C8)

Forecast: ka unconstrained minimum hai, jahan . par constraint kya karti hai?

  1. Gradients. , .
  2. Equations. , . Isliye .
  3. Constraint. .
  4. Multiplier. . Yeh kyun dekhen? measure karta hai ki constraint kitni "hard push" kar rahi hai. Jab , .
  5. Interpret karo. par constrained minimizer hai — unconstrained minimizer, jo pehle se hi line par lie karta hai. Constraint kuch cost nahi karti, isliye uski shadow price zero hai. Yeh limit Unconstrained optimization — critical points se link karti hai.

Ex 9 — Exam twist: Lagrange point jo maximum nahi hai (cell C9)

Forecast: hyperbola sketch karo. Kya ka is par koi maximum hai hi?

Figure s05 (neeche): kala hyperbola do branches mein hai. Red dot par hai jahan Lagrange land karta hai; kala annotation dikhata hai ki bina bound ke badhta rehta hai jab tum right branch par upar slide karte ho — isliye woh red dot branch par ka minimum hai, maximum nahi.

Figure — Lagrange multipliers — one and two constraints
  1. Gradients. , . Kyun? Hum dono arrows "twist" problem mein bhi banaate hain — trap result interpret karne mein hai, setup mein nahi.
  2. Equations. aur . Doosra deta hai (reject, kyunki yeh equation 1 khatam kar deta hai) ya . Isliye . reject kyun? Agar , equation 1 padhi jaaye to , impossible — isliye sirf live branch hai.
  3. Constraint impose karo. ke saath: . Candidates , . Yahan kyun compute karein? Yeh confirm karta hai ki dono candidates legitimate stationary points hain (finite non-zero ); problem yeh nahi ki Lagrange fail hua, balki yeh ki points ka kya matlab hai.
  4. Honestly classify karo. Right branch ko parametrize karo ke roop mein. Jab , bina bound ke badhta hai. Isliye us branch par ka koi maximum nahi; point wahan hai jahan sabse chhota hai (vertex), yani yeh ek minimum hai, maximum nahi. Parametrize kyun? Yeh implicit curve ko ek variable ke explicit function mein convert karta hai taaki hum ka behaviour directly dekh sakein aur max-vs-min guessing ki jagah settle kar sakein.
  5. Conclusion. Jaise problem rakha gaya hai usmein hyperbola par ka koi maximum nahi (). Lagrange ne sach mein ek stationary point ke roop mein return kiya, lekin yeh branch minimum hai; left branch par analogous vertex hai. Seekh: Lagrange point ko label karne se pehle hamesha pucho ki kya extremum exist bhi kar sakta hai (kya objective feasible set par bounded hai?).

Recall Self-test

Unit circle par, do alag values kyun deta hai? ::: Kyunki max ( par, ) aur min ( par, ) alag constrained extrema hain, har ek ka apna parallel-scaling factor hota hai. Kaunsa ek check Ex 7 ko instantly kill kar deta? ::: Test karo ki aur linearly independent hain ya nahi — yahan , isliye feasible set empty ho sakta hai aur method applicable nahi hai.

Connections