NCERT Solutions
Exercises 12.1 and 12.2 — Linear Programming
Graphical method for LPP; bounded and unbounded feasible regions; manufacturing/diet/allocation word problems; maximise profit, minimise cost; optimal solution interpretation
20 questions✓ Free · step-by-step
🧱
Step-by-step solutions are being added
Our subject-matter experts are publishing solutions for Exercises 12.1 and 12.2 of Linear Programming. In the meantime, read the chapter or jump to similar resources.
Take the next step
Need help with Exercises 12.1 and 12.2? Get a tutor
Pair self-study with a tutor, a live course or a coaching centre.
