The 12th chapter for CBSE Class 12 Maths is titled as Linear Programming. In mathematics, it can simply be defined as the method used for minimizing or maximizing the linear function of several variables. With the help of these revision notes, students can make last-minute preparations while preparing for their Math exams. Some of the various concepts that are introduced in this chapter are:
- Definition of Linear programming and its applications. It is primarily used in everyday life, for obtaining the minimum and maximum values which are used in making business decisions as well.
- Other important mathematical formulas that students are taught in this chapter are Optimal value, Objective function, Linear constraints, Non-negative restrictions and, Optimisation problems.
- Apart from this, the mathematical formulation of the problem is also provided, along with the graphical method used in solving linear programming problems.
CBSE Notes for Class 12 Maths Chapter 12 Linear Programming
You may also want to read:
| Local Maxima and Minima |
| Variable |
Frequently asked Questions on CBSE Class 12 Maths Notes Chapter 12: Linear Programming
Q1
What is ‘Linear Programming’?
Linear programming is a process of optimising the problems which are subjected to certain constraints.
Q2
What is ‘Absolute Maxima’?
An absolute maximum point is a point where the function obtains its greatest possible value.
Q3
What is ‘Non-negative restriction’?
Non-negativity restriction indicates that all decision variables must take on values equal to or greater than zero.
Comments