4.1.31 · D3 · HinglishCalculus I — Limits & Derivatives

Worked examplesOptimization — constrained, unconstrained, real-world problems

3,592 words16 min read↑ Read in English

4.1.31 · D3 · Maths › Calculus I — Limits & Derivatives › Optimization — constrained, unconstrained, real-world proble


The scenario matrix

Har optimization problem inhi cells mein se kisi ek mein hoti hai. Hum har row mein kam se kam ek example solve karenge.

Cell Kya cheez special hai Answer kahan milta hai Example
A. Interior max smooth hilltop, andar ka ek critical point Ex 1
B. Interior min smooth valley, andar ka ek critical point Ex 2
C. Endpoint wins derivative kabhi zero nahi, ya critical point haar jaata hai domain ki boundary Ex 3
D. Degenerate / second-derivative test andha hai first-derivative sign test chahiye Ex 4
E. Constrained (substitution) ek variable ek side relation se khatam kar diya reduced problem ka interior Ex 5
F. Constrained (Lagrange) dono variables rakho, use karo tangency point Ex 6
G. Real-world word problem prose ko symbols mein, phir derivative mein translate karo jahan bhi recipe le jaaye Ex 7
H. Exam twist (hidden domain / units) "obvious" root illegal hai ya galat cheez optimize ho rahi hai domain / units check ke baad Ex 8

Koi bhi symbol aane se pehle, ek convention.


Cell A — Interior maximum

Forecast: aage padhne se pehle sabse bade rectangle ki shape guess karo. (Square? Lamba patla strip?)

Figure — Optimization — constrained, unconstrained, real-world problems
  1. Naam do aur model banao. Maano sides aur hain (metres mein). Area . Yeh step kyun? Jo cheez hum optimize karna chahte hain use symbols mein likhna zaroori hai differentiate karne se pehle.
  2. Ek variable mein constrain karo. Fence perimeter hai: . Yeh step kyun? mein do unknowns hain; 1-D derivative ke liye ek chahiye. Perimeter relation se eliminate ho jaata hai.
  3. Reduce karo. , domain (ek side negative nahi ho sakti, aur se ke liye kuch nahi bachta). Yeh step kyun? Ab ek variable mein plain parabola hai — figure mein red curve dekho, ek ulta bowl.
  4. Derivative zero karo. . Yeh step kyun? ∩-shaped area curve ke top par slope flat hoti hai, isliye slope ko zero set karte hain.
  5. Classify karo. → cap-shaped → second-derivative test se local maximum. Yeh step kyun? Zero slope akele hilltop, dip, ya inflection ho sakta hai; negative curvature hilltop confirm karta hai.
  6. Answer. , , area . Optimal pen ek square hai.

Cell B — Interior minimum

Forecast: kya sabse sasta can tall aur thin hoga, short aur fat, ya kuch beech mein?

  1. Model banao. Ek closed cylinder ki surface area: (do circular lids aur wall). Yeh step kyun? Metal used = total surface area; wahi quantity minimize karni hai.
  2. Constrain karo. Volume height fix karta hai: . Yeh step kyun? Do unknowns hain; volume condition remove kar deta hai.
  3. Reduce karo. , domain . Yeh step kyun? Ab sirf par depend karta hai. Jab toh term blow up hoti hai; jab toh term blow up hoti hai — toh minimum beech mein kahi hona chahiye.
  4. Derivative zero karo. . Toh . Yeh step kyun? ∪-shaped cost curve ke bottom par slope flat hoti hai.
  5. Classify karo. sab ke liye → cup → minimum. Yeh step kyun? Valley confirm karta hai, peak nahi.
  6. Answer. , — note karo : optimal can bilkul utna hi tall hai jitna wide hai.

Cell C — Endpoint jeet jaata hai

Forecast: sabse chhoti value kahan hogi — andar, ya kisi edge par?

Figure — Optimization — constrained, unconstrained, real-world problems
  1. Differentiate karo. . Yeh step kyun? Pehle flat spots dhundhte hain.
  2. set karo. ka koi solution nahi hai — hamesha positive hota hai, toh har jagah. Yeh step kyun? Koi interior critical point exist nahi karta; slope hamesha downhill hai (strictly falling red curve dekho).
  3. Closed Interval Method par fall back karo. Koi interior candidate nahi hai toh extremes dono endpoints hone chahiye. Evaluate karo: (maximum), (minimum). Yeh step kyun? Ek closed interval par continuous function hamesha apne extremes attain karta hai; agar andar nahi toh wall par milenge.
  4. Answer. Minimum value at ; maximum at .

Cell D — Second-derivative test fail ho jaata hai ()

Forecast: kya min hai, max hai, ya kuch nahi?

  1. Critical points dhundho. . Yeh step kyun? Flat-spot hunt.
  2. Second-derivative test try karo. , toh inconclusive. Yeh step kyun? Parent ka Taylor argument use karta tha; agar toh woh term vanish ho jaati hai aur change ka sign nahi bata sakti.
  3. Iske badle first-derivative sign test use karo. ka sign har side check karo:
    • ke liye: (downhill).
    • ke liye: (uphill). Yeh step kyun? Ek point ke aas-paas down-then-up bilkul valley ka fingerprint hai — koi curvature number ki zaroorat nahi.
  4. Answer. Slope phir jaati hai ⇒ par local (aur global) minimum.

Cell E — Substitution se constrained

Forecast: kya sabse paas wala point vertex hai, ya woh side mein kahi shift ho jaata hai?

Figure — Optimization — constrained, unconstrained, real-world problems

Picture scene set karti hai: black parabola , red target dot par, aur red segment jo hum minimize karenge seedha vertex tak neeche jaata hai. Us segment par dhyan rakho — neeche ki algebra prove karegi ki yahi sabse chhota segment hai.

  1. Distance model banao — lekin square karo. Parabola par kisi general point se tak Distance: Square kyun? increasing hai, toh jo bhi minimize karta hai woh true distance bhi minimize karta hai — aur algebra polynomial rehti hai (parent ka trick, cell yahan reuse hua).
  2. Constraint substitute karo. Humne pehle hi use karke ek variable mein likha — yahi substitution route hai. Domain sab real hai: parabola dono taraf infinitely stretch karti hai, toh koi endpoints worry nahi. Yeh step kyun? "Point on a curve" problem ko ordinary 1-D optimization mein badalta hai, aur exactly fix karta hai kaun se -values compete kar rahe hain.
  3. Expand aur differentiate karo. . Yeh step kyun? Reduced function par flat-spot hunt. (Notice karo terms ka neat cancellation.)
  4. "Infinity par" rule out karo. Kyunki aur jab , vertex se door distance badh jaati hai — toh koi better point tails mein nahi chhupa hai. Isliye single interior critical point global minimum hai. Yeh step kyun? Unbounded domain par koi endpoints nahi hote; hume yeh sure karne ke liye limiting behaviour check karna padta hai ki minimum genuinely global hai.
  5. Classify karo. ke aas-paas, jaata hai (same cell-D reasoning, kyunki ): down phir up, valley. Yeh step kyun? Confirm karta hai ki yeh nearest point hai, farthest nahi.
  6. Answer. Nearest point vertex hai, distance — bilkul figure mein red vertical segment.

Cell F — Lagrange multipliers se constrained

Forecast: unit circle par kaun si direction "sabse north-east" point karti hai?

Figure — Optimization — constrained, unconstrained, real-world problems
  1. Gradients set up karo. ke saath: Yeh step kyun? Ek constrained optimum par, constraint curve ke perpendicular hona chahiye — yaani ke parallel (Lagrange condition dekho). Red arrow north-east point karta hai; optimum wahan hota hai jahan woh outward radius ke saath align ho.
  2. likho. Component by component: Yeh step kyun? Parallel vectors scalar multiples hote hain; woh scalar hai.
  3. Solve karo. Dono equations deti hain, toh . Yeh step kyun? ke equal partials yahan equal coordinates force karte hain.
  4. Constraint apply karo. jab ho toh . Yeh step kyun? Hume circle par land karna hai, sirf tangency satisfy karna kaafi nahi.
  5. Evaluate aur answer do.
    • : maximum.
    • : minimum.

Cell G — Real-world word problem

Forecast: kya woh swimmer ki taraf seedha jaati hai, ya aur aage beach par jaati hai taaki fast sand par zyada waqt bitaaye?

Figure — Optimization — constrained, unconstrained, real-world problems
  1. Total time model banao. Run distance (beach ke saath), swim distance . Time kyun, distance nahi? Dono legs ki speeds alag hain, toh time woh honest quantity hai jo minimize karni hai (yeh exactly Snell's-law / Fermat's-principle logic hai).
  2. Differentiate karo. Square root par chain rule use karte hue: Chain rule kyun? Swim distance ek square root ke andar function hai; chain rule "function of a function" handle karta hai.
  3. set karo. maano: Yeh step kyun? Flat spot sabse fast path mark karta hai; set karna aur fractions clear karna geometry isolate karta hai. Substitution sirf algebra tidily karta hai — woh horizontal swim distance ka naam deta hai.
  4. Carefully square karo. ko square karna tabhi valid hai jab right side non-negative ho, yaani ; hum woh restriction rakhte hain aur wala koi bhi root extraneous maan ke discard karenge. Square karne par: . Negative root extraneous hai ( fail karta hai), toh . Yeh step kyun? Squaring false solutions invent kar sakta hai; gate aur sign check unhe remove karta hai.
  5. Back-substitute karo. m. Yeh step kyun? Humne ke liye solve kiya; question shore point poochh raha hai.
  6. Classify / endpoints check karo. s, s, aur s — interior point dono edges ko beat karta hai, toh woh par minimum hai. Yeh step kyun? Fermat sirf ek candidate deta hai; endpoints compare karna prove karta hai ki woh globally best hai.

Cell H — Exam twist (illegal root / wrong objective)

Forecast: guess karo ki field river ke saath zyada wide hoga ya perpendicular.

  1. Model aur constrain karo. Fence length (do ends length ke, ek far side length ki). Area: . Yeh step kyun? Sirf teen sides fenced hain — geometry sahi padhna exam ki aadhi ladaai hai.
  2. Reduce karo. , domain . Yeh step kyun? Ek variable, differentiate karne ke liye ready.
  3. Derivative zero karo. . Sign factor kyun nikalo? Do algebraic roots appear hote hain: aur .
  4. Twist — illegal root reject karo. Fence length negative nahi ho sakti, toh domain ke bahar hai; discard karo. Sirf bachta hai. Yeh step kyun? Yahi classic exam trap hai: ka ek genuine root jo physically impossible hai.
  5. Classify aur answer do. at → minimum. Phir , aur m. Yeh step kyun? Positive curvature valley confirm karta hai; actual fence length units ke saath report karo.

Recall Main kaun si cell mein hoon? (self-quiz)

Function par strictly increasing hai — max kahan hai? ::: Right endpoint par (Cell C). aur — agli tool? ::: First-derivative sign test (Cell D). Do variables ek equation se tied hain, ek eliminate karna hai — kaun sa method? ::: Substitution (Cell E). Do variables, constraint explicitly solve karna mushkil — kaun sa method? ::: Lagrange multipliers, (Cell F). Ek length ke liye mila — kya karo? ::: Reject karo; woh physical domain ke bahar hai (Cell H). Do speeds mein time optimize karna — distance minimize karo ya time? ::: Time, kyunki speeds alag hain (Cell G).


Connections

Case Map

no

yes

no

yes

yes

no

Optimization problem

One variable already?

Eliminate a variable

Constraint solvable?

Substitution

Lagrange multipliers

Kill derivative

Any flat spot?

Sign test or second derivative

Check endpoints

Reject illegal roots

Answer with units