Home / Class 12 / Mathematics / Chapter 12
रैखिक प्रोग्रामन
Graph banao, corners dhundo, best answer pao — sabse scoring chapter
Linear Programming 5 animated scenes mein - feasible region builder, corner point method, unbounded trap lab, 5-marker step solver, aur quiz.
Walkthrough Kholo →Concept pakka karne ke liye — aaram se padho
💡 Feel: factory me 2 products, limited material/time — kitna-kya banaye ki profit MAX? Yehi LPP solve karta hai.
🎯 Drawing tip: scale sahi lo, har line label karo, feasible region dark shade karo — boards me graph ke marks hote hain!
💡 Kyun corners pe? Z = ax + by lines ke parallel family hai — Z badhate jao to line slide hoti hai, region chhodne se PEHLE corner pe rukti hai!
🎯 Unbounded = "region khula hai" — answer confirm karne se pehle half-plane overlap test ZAROORI hai. Ye step marks ka deciding factor hai!
💡 LPP ab "graph padhna + corners pe arithmetic" — chapter chhota aur scoring hai, pakka 5 marks!
💡 सीमित संसाधनों में सर्वोत्तम परिणाम — यही LPP है।
🎯 पैमाना सही लो, रेखाएं लेबल करो, क्षेत्र गहरा छायांकित करो — आलेख के अंक हैं!
💡 Z = ax + by समांतर रेखाओं का परिवार है — रेखा क्षेत्र छोड़ने से पहले कोने पर रुकती है!
🎯 अपरिबद्ध = अतिरिक्त अर्ध-समतल जांच अनिवार्य — यही अंकों का निर्णायक चरण!
💡 LPP = "आलेख + कोनों की अंकगणित" — छोटा और स्कोरिंग अध्याय!
💡 Feel: a factory with 2 products and limited material/time — how much of each should it make for MAX profit? That is what an LPP solves.
🎯 Drawing tip: use a proper scale, label every line, shade the feasible region dark — boards award marks for the graph!
💡 Why corners? Z = ax + by is a family of parallel lines — as Z grows the line slides, and it stops at a corner JUST before leaving the region!
🎯 Unbounded = "the region is open" — the half-plane overlap test is MANDATORY before confirming the answer. This step decides your marks!
💡 LPP is now "read a graph + corner arithmetic" — a small, high-scoring chapter. A guaranteed 5 marks!
Exam se pehle sirf yeh dohrao
Pehle khud solve karo, phir answer dekho.
Z = ax + by — jo cheez maximize/minimize karni hai (profit, cost...).
Non-negativity constraints — real life me cheezein negative nahi ban sakti. Isse region first quadrant me aata hai.
Test point (0, 0) inequality me daalo — true → origin side, false → opposite side.
SAARI constraints (inequalities) ka common region — jahan sab conditions ek saath satisfy hoti hain.
Hamesha kisi corner point pe — feasible region ke vertices pe Z check karo.
Z: 0, 20, 18 → max = 20 at (5, 0); min = 0 at (0, 0).
Do-do boundary lines ki equations simultaneously solve karke — intersections hi corners hain.
Z < m wala half-plane feasible region ko overlap karta hai ya nahi — overlap nahi to min confirmed.
Nahi — point (x, y) bhi likhna zaroori hai jahan optimum milta hai.
Nahi — mathematical formulation of LPP rationalized syllabus se delete ho gaya. Ready-made problems solve karne hain.