NCERT Class 12 Linear Programming: Methods, Problems, and Solutions

Imagine you have limited money, time, and resources—but unlimited possibilities. How do you decide the best way to use what you have? Whether it’s maximizing profit in a business or minimizing cost in daily life, decision-making often involves constraints. This is exactly where Linear Programming comes into play. It is a powerful mathematical tool that helps students solve real-life optimization problems. In this blog, we’ll break down concepts, methods, and exam-focused problems in a simple and practical way.

What is Linear Programming? 

Linear Programming (LP) is a mathematical method used to find the best possible outcome—either maximum or minimum—under given conditions. These conditions are represented using linear equations or inequalities, and the goal is to optimize a particular value, such as profit, cost, or time.

In simple terms, a Linear Programming Problem (LPP) helps us answer questions like:

• How can we maximize profit?
• How can we minimize cost or effort? 

For example, a business owner may want to produce goods in a way that earns the highest profit using limited resources. This is where LPP becomes extremely useful.

A classic NCERT example explains this beautifully: a furniture dealer must decide how many tables and chairs to buy using limited money and storage space to earn maximum profit . Such real-life problems are solved using linear programming techniques.

Linear Programming is not just about formulas—it is about logical thinking and decision-making. That’s why it is considered both a concept-based and application-based chapter.

For students, it is also a highly scoring topic because once the concept is clear, solving problems becomes systematic and predictable.

Key Terminologies in Linear Programming

Understanding the basic terms is essential to mastering Linear Programming. Let’s break them down in a simple way:

Decision Variables

These are the variables that represent the quantities we need to find.
For example, if a problem involves producing tables and chairs, we can take:

• x = number of tables
• y = number of chairs 

Objective Function

This is the function we want to maximize or minimize.
It is always written in terms of decision variables.

Example:
Z = 250x + 75y
Here, Z represents profit, and the goal could be to maximize Z.

Constraints

Constraints are the restrictions or limitations in the problem.
They are expressed as linear inequalities.

For example:

• Limited budget
• Limited storage space 

These conditions define what values x and y can take.

Non-Negativity Constraints

These ensure that the values of variables are not negative:

• x ≥ 0  
• y ≥ 0  

This makes sense because quantities like the number of items cannot be negative.

Feasible Region

The region that satisfies all the constraints together is called the feasible region.
It is usually shown on a graph as a shaded area.

Feasible Solution

Any point inside or on the boundary of the feasible region is a feasible solution.
These are all the possible valid solutions.

Optimal Solution

The best solution among all feasible solutions is called the optimal solution.
It gives the maximum profit or minimum cost, depending on the problem.

Mathematical Formulation of LPP

To solve a Linear Programming Problem, we first need to convert the given situation into a mathematical form. This process is called mathematical formulation.

Steps to Formulate an LPP

Step 1: Define the variables

Assign variables to the quantities involved.
Example:
x = number of tables
y = number of chairs

Step 2: Write the objective function

Identify what needs to be maximized or minimized.
Example:
Z = 250x + 75y (profit)

Step 3: Form the constraints

Translate the given conditions into inequalities.

From the NCERT example:

• Investment constraint: 5x + y ≤ 100
• Storage constraint: x + y ≤ 60 

Step 4: Add non-negativity conditions

x ≥ 0, y ≥ 0

Final Mathematical Model

Maximize or Minimize:
Z = ax + by

Subject to:

• Linear constraints (inequalities)
• Non-negativity conditions 

This structured approach makes it easier to solve even complex real-life problems using mathematical tools.

Graphical Method to Solve LPP

The graphical method is the most common way to solve Linear Programming Problems involving two variables. It helps visualize the solution and makes the process easier to understand.

Steps Involved

Step 1: Convert inequalities into equations

Replace ≤ or ≥ with = to draw boundary lines.

Step 2: Plot lines on a graph

Draw each equation on the coordinate plane.

Step 3: Identify the feasible region

Shade the area that satisfies all inequalities.
This common shaded region is the feasible region.

Step 4: Find corner points (vertices)

Identify the points where the boundary lines intersect.

Step 5: Evaluate the objective function

Substitute each corner point into the objective function (Z).
The point that gives the maximum or minimum value is the solution.

Book a Free Demo Class Today. 

Important Concepts

Convex Region

The feasible region is always convex, meaning any line segment joining two points in the region lies entirely within it.

Bounded vs Unbounded Region

• Bounded Region: Closed area → always gives a solution
• Unbounded Region: Open area → may or may not give a solution 

Corner Point Theorem

This theorem states that the optimal value (maximum or minimum) always occurs at the corner points (vertices) of the feasible region.

The graphical method not only helps in solving problems but also builds a strong visual understanding of how constraints affect outcomes—making Linear Programming both practical and intuitive.

Corner Point Method Explained

The Corner Point Method is one of the most important techniques used to solve Linear Programming Problems graphically. It is based on a key theorem:

Theorem

The optimal value (maximum or minimum) of the objective function always occurs at the vertices (corner points) of the feasible region.

This means instead of checking every possible point (which are infinite), we only need to evaluate a few corner points—making the process simple and efficient.

Steps of the Corner Point Method

Step 1: Identify the feasible region

Plot all constraints on a graph and determine the common shaded area.

Step 2: Find the vertices (corner points)

These are the points where boundary lines intersect.

Step 3: Substitute in the objective function (Z)

Calculate the value of Z at each vertex.

Step 4: Choose the maximum or minimum value

• For maximization → select highest value
• For minimization → select lowest value 

Basic Example

Suppose:
Maximize Z = 4x + y

Subject to:
x + y ≤ 50
3x + y ≤ 90
x ≥ 0, y ≥ 0

After graphing, we find vertices like (0,0), (30,0), (20,30), and (0,50).
Now substitute each into Z:

• Z(0,0) = 0
• Z(30,0) = 120
• Z(20,30) = 110
• Z(0,50) = 50 

So, the maximum value is 120 at (30,0).

This method is reliable, quick, and widely used in exams.

Special Cases in Linear Programming

In exams, questions are not always straightforward. Sometimes, Linear Programming Problems involve special cases that test your conceptual clarity. Understanding these can help you avoid confusion and score better.

Unique Optimal Solution

This is the most common case.
Here, the objective function gives the best value at only one corner point.

Example:
If Z is maximum only at (4, 2), then that is the unique solution.

This is the standard case most students are familiar with.

Multiple Optimal Solutions

Sometimes, two corner points give the same value of the objective function.

What happens then?

• Every point on the line segment joining those two vertices also gives the same optimal value
• This means there are infinitely many optimal solutions 

Example:
If Z = 100 at both (2,3) and (4,1), then all points between them are also optimal.

Unbounded Solution

In some problems, the feasible region is not closed and extends infinitely.

Important:

• The objective function may not have a maximum or minimum value
• You must check if values keep increasing/decreasing indefinitely 

Example idea:
If profit keeps increasing as x increases, there may be no maximum value

No Feasible Solution

This happens when constraints do not overlap at all.

Result:

• No common feasible region
• No solution exists 

Example:
x + y ≤ 5 and x + y ≥ 10 → No overlap → No solution

These cases are frequently tested in exams to check whether students truly understand the concept beyond basic solving.

Types of Linear Programming Problems

Linear Programming Problems can be classified based on their objective and solution region:

Maximization Problems

These problems aim to maximize a quantity such as profit, output, or production.
Example: Maximizing profit in a business setup.

Minimization Problems

These focus on minimizing cost, time, or resources.
Example: Reducing transportation cost or minimizing expenses.

Bounded Region Problems

• The feasible region is closed and limited.
• These problems always have both maximum and minimum solutions. 

Unbounded Region Problems

• The feasible region extends infinitely.
• These problems may or may not have a solution.
• Additional checks are required to confirm optimal values. 

No Feasible Solution Case

• Occurs when constraints do not overlap.
• There is no common region satisfying all conditions.
• Hence, no solution exists. 

Understanding these types helps students quickly identify the nature of the problem and apply the correct approach.

Plan Your Free Math Demo Class Today. 

Solved Examples (Exam-Oriented)

Let’s look at some typical exam-style problems:

Example 1: Maximization Problem

Maximize Z = 3x + 4y
Subject to:
x + y ≤ 4
x ≥ 0, y ≥ 0

Steps:

• Plot constraints
• Identify feasible region
• Find corner points: (0,0), (4,0), (0,4)
• Evaluate Z: 

Z(0,0) = 0
Z(4,0) = 12
Z(0,4) = 16

Answer: Maximum Z = 16 at (0,4)

Example 2: Minimization Problem

Minimize Z = 2x + 3y
Subject to:
x + 2y ≥ 6
x ≥ 0, y ≥ 0

Steps:

• Plot inequalities
• Find feasible region
• Identify corner points
• Substitute in Z 

Choose the minimum value from the calculated results.

Example 3: Multiple Optimal Solutions

Maximize Z = 3x + 9y

Sometimes, two corner points give the same value of Z.
In such cases:

• Every point on the line segment joining them is also optimal
• This is called multiple optimal solutions 

Example 4: No Solution Case

If constraints do not intersect, no feasible region is formed.
Example:
x + y ≥ 10
x + y ≤ 5

Here, no point satisfies both conditions → No feasible solution

You May Also Read

Learn Vectors Step by Step for Class 12 Maths

Practice Questions (Category-wise)

A. Basic Concept-Based Questions 

1. Define Linear Programming.
2. What is an objective function?
3. Define feasible region.
4. What are constraints?
5. What is a feasible solution?
6. What is an optimal solution?
7. Define decision variables.
8. What is a convex region?
9. What are non-negativity constraints?
10. Give one real-life example of LPP. 

B. Graph-Based Questions 

1. Solve graphically: x + y ≤ 4
2. Find feasible region for: 2x + y ≤ 6
3. Plot and identify region: x ≥ 0, y ≥ 0
4. Solve: x + 2y ≤ 8
5. Draw graph for: 3x + y ≤ 9
6. Identify vertices of region
7. Shade feasible region
8. Check bounded/unbounded region
9. Find corner points
10. Represent inequality graphically 

Book Your Free Demo Now. 

C. Maximization Problems 

1. Maximize Z = 3x + 4y
2. Maximize Z = 5x + 2y
3. Maximize Z = 4x + y
4. Maximize Z = x + y
5. Maximize Z = 6x + 3y
6. Solve a profit-based problem
7. Resource allocation problem
8. Production optimization
9. Time-based optimization
10. Mixed constraint problem 

D. Minimization Problems 

1. Minimize Z = 2x + 3y
2. Minimize Z = 5x + 4y
3. Minimize Z = x + 2y
4. Cost minimization case
5. Diet problem
6. Transportation-type problem
7. Mixed inequalities
8. Resource minimization
9. Linear cost model
10. Constraint-heavy problem 

E. Case-Based / Word Problems 

1. Furniture problem
2. Factory production
3. Diet planning
4. Investment problem
5. Transport optimization
6. Machine usage
7. Workforce allocation
8. Budget allocation
9. Storage problem
10. Profit maximization scenario 

Quick Revision Notes / Cheat Sheet

Need a quick recap before exams? Here’s your last-minute revision guide for Linear Programming:

Key Formulas

• Objective Function: Z = ax + by
• Constraints: Linear inequalities (e.g., x + y ≤ 10)
• Non-negativity: x ≥ 0, y ≥ 0 

Steps to Solve LPP (Graphical Method)

1. Convert inequalities into equations
2. Plot boundary lines on the graph
3. Identify and shade the feasible region
4. Find corner points (vertices)
5. Substitute vertices into Z
6. Choose the maximum or minimum value 

Schedule Your Free Demo Class Now. 

Important Theorems

• Corner Point Theorem: Optimal value occurs at the vertices
• If the feasible region is bounded, both max and min values exist
• If unbounded, the solution may or may not exist 

Graph Rules to Remember

• Use a test point (0,0) to decide shading
• Solid line → includes boundary (≤ or ≥)
• Dotted line → excludes boundary (< or >)
• A feasible region is always convex
• Intersection points = corner points 

Exam Quick Tips

• Always include non-negativity constraints
• Label axes and points clearly
• Double-check calculations of Z
• Neat graph = extra marks 

Common Mistakes Students Make

• Ignoring non-negativity constraints (x ≥ 0, y ≥ 0), which changes the feasible region
• Incorrect graph plotting, especially choosing the wrong side of inequality
• Missing or incorrectly shading the feasible region
• Errors in identifying corner points (vertices)
• Calculation mistakes while substituting values into the objective function (Z)
• Confusing maximization and minimization, leading to wrong final answer
• Not labeling graph properly (axes, points, lines)
• Skipping steps, which leads to careless errors 

Tip: Following a step-by-step approach and practicing regularly can help avoid these mistakes.

Tips to Score High in Exams

• Practice graph plotting daily to improve speed and accuracy
• Learn and follow a standard step-by-step method for every question
• Focus on NCERT examples, as exam questions are often similar
• Revise key formulas and theorems (especially Corner Point Theorem)
• Attempt case-based and word problems for better understanding
• Draw neat, well-labeled graphs to gain extra marks
• Double-check corner points and Z calculations before final answer
• Identify early whether the problem is maximization or minimization
• Manage time efficiently—don’t spend too long on one question
• Stay calm and avoid rushing to reduce silly mistakes

Why Learn Linear Programming with PlanetSpark

Understanding Linear Programming becomes much easier when concepts are taught in a simple, engaging, and practical way—and that’s exactly what PlanetSpark offers.

• Simple explanations with real-life examples
• Interactive learning sessions that keep students engaged
• Personal attention to clear individual doubts
• Strong focus on concept clarity instead of rote learning
• Application-based teaching approach for better understanding
• Helps build strong analytical and problem-solving skills
• Boosts confidence for exams and real-life situations 

With PlanetSpark, students don’t just learn how to solve problems, they understand the logic behind them, making learning more effective and long-lasting.

Master Decision-Making with Linear Programming

Linear Programming is more than just a chapter; it’s a life skill that teaches smart decision-making under constraints. From maximizing profits to minimizing costs, it builds analytical thinking that goes beyond textbooks. With the right approach, consistent practice, and conceptual clarity, this chapter can become one of the easiest scoring topics in Class 12 Maths. Focus on understanding the logic, not memorizing steps, and you’ll confidently solve any problem that comes your way.

Also Read 

Explore 331+ NCERT Solutions – Free to Download