CBSE · Class 12 · Mathematics · Chapter 12

Linear Programming

Optimization using linear programming.

4 lessons 55 min
Start chapter

Lessons in this chapter

  1. 1Modeling Decisions with Linear ProgrammingTurn a choice about limited resources into variables, constraints, and a quantity to optimise.
  2. 2Feasible Regions and Corner-Point SolutionsUse graphs and vertex values to find unique or multiple optimal solutions in bounded regions.
  3. 3Unbounded and Infeasible ProblemsDecide whether a best value exists when a region extends indefinitely or when constraints have no common solution.
  4. 4Chapter Summary and PracticeConnect modeling, feasible geometry, vertex calculations, and the different possible optimisation outcomes.
← All Class 12 Mathematics chapters