Linear Programming Lab 📊

Feasible region banate dekho, objective function sweep karo, aur corner points par optimal solution khud dhundo!

🔧 Lab 1: Constraints Adjust karo — Feasible Region Dekho

Sliders move karo. Constraints ki lines move hongi aur feasible region (shaded) live update hogi. Corner points automatically mark honge!

C1: x + y ≤ 8 C2: 2x + y ≤ 12 C3: x + 3y ≤ 12

🎯 Lab 2: Objective Function — Line Sweep

Z = cx + dy. Slider se Z ki value badhao. Dekho isoprofit line kitna door ja sakti hai feasible region mein. Jahan line last touch kare — wahi optimal point!

c (x coefficient)= 3 d (y coefficient)= 5 Z = 10

🏆 Lab 3: NCERT Example — Step-by-Step Solve

Classic problem: Maximize Z = 3x + 5y subject to constraints. Har step dekho — graph, corner points, aur optimal value!