Which Chapter Is Linear Programming Class 12? Complete Guide

Introduction to Linear Programming in Class 12 Maths

Linear Programming is a branch of mathematics that deals with optimizing (maximizing or minimizing) a linear objective function, subject to a set of linear inequalities or equations called constraints. In Class 12 NCERT Mathematics, this topic is introduced as Chapter 12.

The chapter helps students develop problem-solving skills by applying mathematical models to real-life situations such as business profit maximization or cost minimization. Understanding which chapter is Linear Programming Class 12 helps students focus their revision and exam preparation effectively.

Key Concepts and Definitions in Linear Programming

Before solving problems, it is important to understand the following terms:

• Objective Function: The linear function to be maximized or minimized, e.g., $Z = ax + by$.
• Constraints: Linear inequalities that restrict the values of variables, e.g., $x + y \leq 10$.
• Feasible Region: The set of all points satisfying all constraints.
• Corner Points: Vertices of the feasible region where the objective function is evaluated.

These concepts form the foundation of the chapter and are crucial for solving problems accurately.

Graphical Method for Solving Linear Programming Problems

The graphical method is used when there are two variables. Steps include:

1. Plot each constraint as a line on the coordinate plane. 2. Determine the feasible region by shading the area satisfying all constraints. 3. Identify corner points of the feasible region. 4. Evaluate the objective function at each corner point. 5. Choose the point that gives the maximum or minimum value.

Example:

Maximize $Z = 3x + 4y$ subject to:

• $x + 2y \leq 8$
• $3x + y \leq 9$
• $x, y \geq 0$

Plotting these constraints and evaluating $Z$ at corner points helps find the optimal solution.

Formulating Linear Programming Problems from Word Problems

A major skill in this chapter is translating real-life situations into mathematical models. Follow these steps:

• Identify variables clearly.
• Write the objective function to maximize or minimize.
• Write constraints as linear inequalities.

Example:

A company produces two products, A and B. Profit per unit is Rs 5 for A and Rs 7 for B. Production constraints are:

• $x + y \leq 10$ (total units)
• $2x + y \leq 16$ (resource limit)

Formulate:

• Objective: Maximize $Z = 5x + 7y$
• Constraints: $x + y \leq 10$, $2x + y \leq 16$, $x,y \geq 0$

This formulation is the first step before graphical solution.

Important Formulas and Tips for Class 12 Linear Programming

While Linear Programming focuses more on concepts and graphical solutions, remember these key points:

• Objective function: $Z = ax + by$
• Constraints: linear inequalities like $ax + by \leq c$
• Feasible region is always a convex polygon
• Optimal solutions occur at corner points

Tips:

• Always check if the feasible region exists
• Label axes and lines carefully
• Practice plotting constraints accurately
• Review solved examples from NCERT for clarity

Comparison: Linear Programming vs Other Class 12 Maths Chapters

Here’s a quick comparison to understand Linear Programming’s unique place:

This shows Linear Programming’s practical application in decision making.