NCERT Books Free Download for Class 12 Maths Chapter-12 Linear Programming

The chapter Linear Programming is divided into five units.The following are some of the topics covered in Chapter 12 of NCERT Solutions for Class 12 Math:

• A linear programming issue is one in which the goal is to determine the best value (maximum or minimum) of a linear function of numerous variables (called the objective function), given that the variables are non-negative and the variables satisfy a set of linear inequalities (called linear constraints). Decision variables are non-negative variables that are sometimes referred to as decision variables. The following are some of the most important linear programming problems:

• Dietary issues

• Problems with manufacturing

• Problems with transportation

• The viable region (or solution domain) of a linear programming problem is the common region given by all the constraints, including the non-negative constraints.

• Possible solutions to the restrictions are represented as points within and on the boundary of the feasible zone.

• A solution that is outside the feasible zone is infeasible.

• An optimal solution is a point in the feasible zone that gives the objective function's optimal value (maximum or minimum).

• A maximum or minimum may not exist if the feasible region is boundless. If it does exist, it must occur at a R corner point.

• When addressing a linear programming issue, the corner point approach is applied.

• If two feasible region corner points are both optimal solutions of the same kind, i.e., they yield the same maximum or minimum, then every point on the line segment connecting them is likewise an optimal solution of the same type.