Linear Programming (LPP) is a highly practical chapter in Class 12 Maths that deals with optimizing a linear objective function subject to a set of linear constraints. LPP has direct applications in business, economics, operations research, and engineering, making it an important chapter for JEE Main.
Linear programming problems require students to:
Formulate the objective function (maximize or minimize)
Identify constraints (inequalities)
Determine the feasible region
Find the optimal solution using graphical or simplex methods
Mastery of LPP ensures that students can solve real-world optimization problems effectively.
► Click “Download Here” next to your subject to access the free PDF.
|
STD 11 |
||
|
1 |
Set Theory |
|
|
2 |
Relation & Function |
|
|
3 |
Trignometrical Ratios , Functions & Identities |
|
|
4.1 |
Complex Numbers |
|
|
4.2 |
Quadratic Equations & Inequations |
|
|
5 |
linear Inequalities |
|
|
6 |
Permutation & Combination |
|
|
7 |
Binomial Theoram |
|
|
8 |
Sequence & Series |
|
|
9 |
Straight Line |
|
|
10.1 |
Circle & System Of Circle |
|
|
10.2 |
Parabola , Ellipse , Hyperbola |
|
|
11 |
Introduction To Three Dimensional Geometry |
|
|
12 |
Limits |
|
|
13 |
Statistics |
|
|
14 |
Probability |
|
|
15 |
Basic Of Algoritham |
|
|
16 |
Rectangular Cartensian Co-Ordinates |
|
|
17 |
Trigonometrical Equations |
|
|
|
|
|
|
STD 12 |
||
|
1 |
Relation & Function |
|
|
2 |
Inverse Trigonometric Function |
|
|
3 |
Determinant & Metrices |
|
|
4 |
Continuity & Differentiation |
|
|
5 |
Application Of Derivatives |
|
|
6 |
Inderfinite Integral |
|
|
7 |
Definite Integral |
|
|
8 |
Application & Integration |
|
|
9 |
Differential Equations |
|
|
10 |
Vector Algebra |
|
|
11 |
Three Dimension Geometry |
|
|
12 |
Linear Programming |
|
|
13 |
Probability |
|
Linear Programming is crucial for JEE Main because:
Questions are often concept-based but scoring if approached systematically.
Helps develop logical reasoning and problem-solving skills.
Optimization problems are highly relevant to applied mathematics and physics.
Graphical methods make it easier to visualize feasible regions and corner points.
Students should focus on the following key areas:
Definition of LPP:
A Linear Programming Problem consists of a linear objective function and a set of linear constraints.
Standard form:
Maximize/Minimize Z = ax + by
Subject to constraints:
c₁x + d₁y ≤ p₁
c₂x + d₂y ≤ p₂
x ≥ 0, y ≥ 0
Objective Function:
The function to be maximized or minimized, e.g., profit, cost, or production.
Constraints:
Linear inequalities representing restrictions on resources, budget, or production capacity.
Feasible Region:
Graphical representation of all points satisfying constraints.
The feasible region is bounded or unbounded and contains all potential solutions.
Corner Point (Extreme Point) Theorem:
The optimal solution lies at one of the corner points of the feasible region.
Graphical Method:
Plot constraints as straight lines
Identify feasible region
Evaluate objective function at corner points to find optimum
Simplex Method (for Advanced Problems):
Algebraic method for higher-dimensional LPP problems
Iterative process to find the maximum or minimum value
Class 12 Linear Programming problems in JEE Main generally include:
Formulating the LPP:
Convert word problems into linear equations and inequalities.
Graphical Method:
Draw lines for each constraint
Shade feasible region
Identify corner points and evaluate objective function
Optimization Problems:
Maximize profit or minimize cost using the feasible region
Problems may involve two variables (x, y) for graphical method
Advanced JEE-Level Problems:
Combine inequalities to find feasible region
Use substitution to check extreme points
Solve multi-constraint optimization problems
For JEE Main, students should follow this approach:
Read the Problem Carefully:
Understand what is to be maximized or minimized.
Identify Variables:
Let x, y represent the quantities to be optimized.
Formulate Constraints:
Write inequalities according to problem restrictions.
Graph the Feasible Region:
Draw each constraint on a 2D graph
Identify intersection points forming the feasible region
Identify Corner Points:
Find coordinates of all vertices of the feasible region.
Evaluate Objective Function at Corner Points:
Substitute corner point values into the objective function to find maximum or minimum.
Check for Feasibility:
Ensure the optimal solution satisfies all constraints.
Always label axes when plotting feasible regions.
Check for negative values; variables in LPP are usually non-negative.
Use inequalities to eliminate infeasible points quickly.
Verify corner points by solving simultaneous equations of intersecting lines.
Practice past JEE Main LPP problems to improve speed and accuracy.
Example 1: Maximize Z = 3x + 5y subject to x + y ≤ 4, x ≥ 0, y ≥ 0
Solution: Feasible region vertices: (0,0), (0,4), (4,0)
Evaluate Z at vertices:
(0,0): Z = 0
(0,4): Z = 20
(4,0): Z = 12
Maximum Z = 20 at (0,4)
Example 2: Minimize Z = 2x + 3y subject to 2x + y ≥ 6, x + y ≥ 4, x ≥ 0, y ≥ 0
Solution: Graph constraints, find feasible region vertices: (2,2), (3,0), (0,4)
Evaluate Z at vertices:
(2,2): Z = 22 + 32 = 10
(3,0): Z = 6
(0,4): Z = 12
Minimum Z = 6 at (3,0)
Example 3: Word Problem – A company produces two products P and Q. Profit for P = $5, for Q = $7. Production constraints: P + 2Q ≤ 10, 2P + Q ≤ 12, P, Q ≥ 0. Maximize profit.
Solution: Formulate objective function: Z = 5P + 7Q
Graph constraints → find feasible region vertices: (0,0), (0,5), (4,0), (2,4)
Evaluate Z at vertices:
(0,0): Z = 0
(0,5): Z = 35
(4,0): Z = 20
(2,4): Z = 52 + 74 = 38
Maximum profit = 38 at (2,4)
NCERT Class 12 Maths textbooks (Chapter: Linear Programming)
Previous years’ JEE Main question papers
Mock tests and online quizzes on Studentbro.in
Video lectures and solved examples for step-by-step learning
Linear Programming is a highly practical and scoring chapter for Class 12 students preparing for JEE Main. Mastery of this chapter:
Develops problem-solving and analytical reasoning skills.
Helps in optimizing real-world situations in economics, business, and engineering.
Provides systematic methods to solve multi-constraint problems quickly.
Prepares students for higher-level mathematics and applied optimization problems.
With consistent practice, careful plotting, and systematic evaluation strategies, Linear Programming can become one of the most scoring chapters in JEE Main Maths.