5 animated scenes - feasible region builder, corner point method, unbounded trap lab, 5-marker solver, aur quiz.
LPP = Z = ax + by ko optimize (max/min) karna, LINEAR INEQUALITIES ke rules me. Har constraint ek line + ek side. Feasible region = SAB constraints ka COMMON area - aur x ≥ 0, y ≥ 0 HAMESHA hota hai (first quadrant!). Method: line banao → (0,0) daal ke test karo → TRUE wala side. Constraints on/off karo - region LIVE badlega!
Corner Point Theorem: bounded feasible region ka max/min HAMESHA kisi CORNER pe milta hai - andar kabhi nahi! Isliye poora region check karne ki zaroorat nahi: corners nikalo → har corner pe Z → table banao → best chuno. Objective function badlo (3 buttons) - WINNER corner badal jaata hai, region wahi rehti hai!
Feasible region KHULA (unbounded) ho toh galti hoti hai! Rule: max/min tabhi declare karo jab TEST HALF-PLANE region se overlap CHHOD DE. Overlap hota raha → max/min exist NAHI. Yahan Z = x + 2y ko region x + y ≥ 3 pe try karo: MAX fail hoga (Z ∞ tak!), par MIN exist karta hai. Direction matter karti hai!
Fixed 5-marker pattern: (1) lines draw karo (intercepts se), (2) (0,0) test se feasible region shade karo, (3) corners nikalo (intersections solve karke), (4) corner table pe Z → answer. Step-by-step aage badho - yehi 4 steps exam me likhne hain. ≥ constraints hain, toh region origin se DOOR aur unbounded - dhyan se!
5 sawaal. Yaad rakho: Z = ax+by optimize; constraints = linear inequalities; x,y ≥ 0 hamesha; graph: line banao → (0,0) test → TRUE wali side; feasible region = common area; max/min corners pe - har corner pe Z, table banao; unbounded ho toh half-plane overlap test - overlap raha toh max/min exist nahi; formulation DELETED, ready-made problems = fixed 5-marker!
Z = ax + by ko optimize (maximize/minimize) | Constraints = linear inequalities | x ≥ 0, y ≥ 0 HAMESHA (first quadrant!) | Feasible region = sab constraints ka common area | Feasible region ke points = feasible solutions
Inequality ko = banao → LINE draw karo (intercepts easiest!) | (0,0) daal ke test karo → TRUE wala side shade | Sab constraints ka COMMON region | Line pe points included (≤, ≥) - solid line
Bounded region: max/min HAMESHA corner pe! | (1) Corners nikalo (line intersections solve karke) | (2) Har corner pe Z | (3) Table banao: corner | Z | (4) Best chuno - bas!
Region khula → EXTRA CHECK zaroori | Test half-plane ax+by > M (max) ya < m (min) region se overlap chhode tabhi declare karo | Overlap hota raha → max/min EXIST NAHI | Unbounded ≠ hamesha fail - direction pe depend!
Corner = do lines ka intersection → equations SOLVE karo | Axis intercepts bhi corners hote hain | Sirf wo corners lo jo SAB constraints satisfy karein | Region ke BAHAR wala intersection corner nahi!
Formulation (word problem → model) DELETED! | Ready-made problems solve karne hain | Fixed 5-marker: graph + region + corners + table | Graph paper pe saaf diagram = full marks