- Free
- CBSE Class 12 Mathematics
- 6 lessons
- About 2 h 2 min
Chapter 12 Linear Programming: Foundation
Chapter 12 of the NCERT Class 12 Mathematics textbook (Mathematics Part II), explained step by step with worked examples, diagrams, practice questions and revision notes.
Start: Optimisation problems and the language of linear programming
Sign in to keep track of your progress.
About this course
Chapter 12 of the NCERT Class 12 Mathematics textbook (Mathematics Part II), explained step by step with worked examples, diagrams, practice questions and revision notes.
What you will learn, lesson by lesson
- Optimisation problems and the language of linear programming See how everyday choices under limits become optimisation problems, and learn the terms of a linear programming problem: decision variables, objective function, constraints and non-negativity restrictions.
- Formulating linear programming problems Turn word problems on production, purchase and mixing into LPPs: choose decision variables, write the objective function, and translate every condition into a linear constraint.
- The feasible region and its corner points Graph the constraints of an LPP, identify the feasible region, feasible and infeasible solutions, tell bounded from unbounded regions, and find the corner points by solving pairs of boundary lines.
- The corner point method for bounded regions Use the fundamental theorems of linear programming to solve LPPs with bounded feasible regions by evaluating the objective function at the corner points.
- Unbounded regions, multiple optimal solutions and infeasible problems Decide whether an optimal value exists when the feasible region is unbounded, recognise multiple optimal solutions along an edge, and identify LPPs that have no feasible region.
- Final self-assessment: Linear Programming Test yourself on the whole course: 15 questions with answers explained.
Lessons in this course
- 1 Optimisation problems and the language of linear programming About 15 min Start
- 2 Formulating linear programming problems About 16 min Start
- 3 The feasible region and its corner points About 18 min Start
- 4 The corner point method for bounded regions About 18 min Start
- 5 Unbounded regions, multiple optimal solutions and infeasible problems About 20 min Start
- 6 Final self-assessment: Linear Programming About 35 min Start
Questions about this course
Is this course free?
Yes. Every lesson in this course is free to read.
How do I keep track of what I've finished?
Create a free account and sign in. Each lesson you finish is saved to your account and shown here and on your dashboard.
Student reviews
No reviews yet. Students who finish a lesson can rate this course.