Linear Programming Problems (LPPs) in Class 12 NCERT Mathematics is a crucial topic
that deals with optimization problems. It involves finding the maximum or minimum
value of a linear function, subject to a set of linear inequalities. Here's a breakdown of
the key concepts:
1. Optimization Problem:
An optimization problem is one that seeks to maximize or minimize a particular quantity (like
profit, cost, or resources) under given conditions or restrictions. Linear programming
problems are a special type of optimization problem where all relationships are linear.
2. Components of a Linear Programming Problem (LPP):
● Objective Function: This is the linear function that you want to optimize
(maximize or minimize). It's typically represented as Z=ax+by, where a and b are
constants, and x and y are the decision variables.
○ Example: If you want to maximize profit, your objective function might be
Z=250x+75y, where x is the number of tables and y is the number of chairs,
and 250 and 75 are the profits per table and chair respectively.
● Decision Variables: These are the variables (e.g., x and y) whose values you
need to determine to achieve the optimal value of the objective function. They
typically represent quantities that can be controlled.
● Constraints: These are the linear inequalities or equations that represent the
limitations or restrictions on the decision variables. They define the feasible
region.
○ Examples:
■ Resource constraints: 2500x+500y≤50000 (investment constraint)
■ Capacity constraints: x+y≤60 (storage constraint)
■ Non-negative constraints: x≥0, y≥0 (quantities cannot be negative)
● Feasible Region: This is the common region determined by all the given
constraints, including the non-negative constraints (x≥0,y≥0). It represents all
possible combinations of the decision variables that satisfy all the given
conditions.
○ The feasible region is always a convex polygon (or a polygonal region).
○ Points within and on the boundary of the feasible region are called feasible
solutions.
○ Points outside the feasible region are called infeasible solutions.
● Corner Points (Vertices): These are the vertices or intersection points of the
boundary lines that form the feasible region.
3. Graphical Method of Solving LPPs:
The most common method for solving LPPs with two variables in Class 12 is the
graphical method. The steps are:
● Formulate the LPP: Convert the given word problem into its mathematical
formulation by defining the objective function and the constraints.
● Graph the Constraints:
○ Treat each inequality as an equation and draw the corresponding line.
○ Determine the half-plane that satisfies each inequality. For example, for
x+y≤4, test a point like (0,0). If 0+0≤4 is true, the region containing (0,0) is
the feasible side.
○ Shade the common region that satisfies all the inequalities. This shaded
region is the feasible region.
● Identify Corner Points: Find the coordinates of all the corner points of the
feasible region. These are the points where the boundary lines intersect.
● Evaluate Objective Function at Corner Points: Substitute the coordinates of
each corner point into the objective function (Z=ax+by) to find the value of Z at
each corner point.
● Determine Optimal Solution:
○ Maximization: The maximum value of Z will occur at one of the corner points.
○ Minimization: The minimum value of Z will occur at one of the corner points.
4. Important Concepts related to Feasible Region:
● Bounded Feasible Region: If the feasible region can be enclosed within a circle,
it is called a bounded feasible region. In such cases, both maximum and minimum
values of the objective function always exist and occur at a corner point.
● Unbounded Feasible Region: If the feasible region extends indefinitely in any
direction, it is called an unbounded feasible region.
○ For an unbounded region, a minimum or maximum value may or may not exist.
○ If a value exists, it will still occur at a corner point.
○ To check if an optimal value exists for an unbounded region (especially for
minimization problems), you may need to draw an additional inequality
representing values less than the potential minimum value and see if it
overlaps with the feasible region. If there's no common point, the minimum
value obtained at the corner point is indeed the optimal one.
5. Types of Linear Programming Problems (as per NCERT):
NCERT Class 12 covers various real-life application-based LPPs, including:
● Manufacturing Problems: These involve maximizing profit by deciding the
production quantity of different products, subject to resource constraints (raw
materials, machine time, labor hours, etc.).
● Diet Problems: These aim to minimize the cost of a diet while ensuring a
minimum requirement of various nutrients.
● Transportation Problems: These deal with finding the cheapest way to transport
goods from various sources to different destinations.
Key Theorems (Implicitly used in NCERT):
● Corner Point Theorem: If the feasible region for a linear programming problem is
bounded, then the objective function has both a maximum and a minimum value
on1 R, and each of these occurs at a corner point (vertex) of R.
● For unbounded regions, if an optimal solution exists, it must occur at a corner
point.
By understanding these concepts and practicing the graphical method, students can
effectively solve Linear Programming Problems as outlined in the NCERT Class 12
Mathematics textbook.
