ISC Class 12 Mathematics Project
Topic: Linear Programming Problem (LPP) — Diet Problem &
Manufacturing Problem
Index
1. Introduction
2. Overview of Linear Programming
3. Important Terms in LPP
4. Types of LPP
5. Problem 1: Diet Problem (Minimizing Cost & Maximizing Nutrition)
o Mathematical Formulation
o Graphical Solution using Corner Method
o Interpretation of Result
6. Problem 2: Manufacturing Problem (Maximizing Profit)
o Mathematical Formulation
o Graphical Solution using Corner Method
o Interpretation of Result
7. Conclusion
8. Bibliography
1. Introduction
Linear Programming is a mathematical technique used to determine the
best possible outcome in a given scenario. It allows us to find the optimal
value—either maximum or minimum—for a particular quantity such as
profit, cost, or time, within a defined set of limitations or constraints. Its
origin can be traced back to the mid-20th century, when it was first used
for military logistics and planning. Over time, Linear Programming has
evolved and found applications in diverse fields such as agriculture,
health, industry, transportation, finance, and nutrition. This project
focuses on two real-world applications of LPP—the Diet Problem and the
Manufacturing Problem.
2. Overview of Linear Programming
Linear Programming (LP) is a method of constrained optimization where a
linear objective function is maximized or minimized subject to a set of
linear inequalities or equations (constraints). The term 'linear' refers to the
linearity of both the objective function and the constraints. LP models
involve decision variables that affect the outcome, and the goal is to
determine the values of these variables that result in the optimal
outcome. Graphical methods are used for problems involving two
variables, while more complex problems require algebraic or
computational approaches. LP enhances strategic decision-making by
simplifying complex problems into manageable forms.
3. Important Terms in LPP
To better understand Linear Programming, one must be familiar with its
core components:
Decision Variables: These are the unknowns in the problem that
decision-makers must determine. For example, x may represent
units of product A and y units of product B.
Objective Function: This is the function to be optimized. It could
represent profit (to be maximized) or cost (to be minimized). It is
typically written in the form Z = ax + by.
Constraints: These are the limitations or requirements imposed on
the decision variables. They are expressed as linear inequalities.
Non-Negativity Restrictions: In real-life situations, negative
values often don't make sense (e.g., producing -2 items), so x ≥ 0
and y ≥ 0 is assumed.
Feasible Region: The set of all points that satisfy all constraints
forms a region on the graph, called the feasible region.
Corner Point: Also called extreme points, these are the intersection
points of the boundary lines of the feasible region.
Optimal Solution: The solution that gives the maximum or
minimum value of the objective function from among all feasible
solutions.
4. Types of LPP
Linear Programming can be broadly classified into various types
depending on the nature of the objective and the context in which it is
used. Some common types include:
Manufacturing Problem: This involves deciding how many units of
each product a factory should manufacture to maximize profit while
staying within limitations such as labor, material, and machine time.
Diet Problem: This is used in health and food industries to
determine the most cost-effective combination of food items that
meets nutritional requirements.
Transportation Problem: In logistics and supply chain
management, LPP is used to minimize the cost or time of
transporting goods from several sources to multiple destinations.
Assignment Problem: This is used to assign tasks or resources
efficiently among workers or departments to minimize time or cost.
Blending Problem: Common in oil and chemical industries, where
raw materials must be mixed in specific proportions to produce a
desired product.
These types highlight the broad applicability and versatility of LPP in real-
world problem-solving.
5. Problem 1: Diet Problem
Objective: Minimize cost and maximize nutrition.
Let’s consider two food items, A and B, with the following properties:
Food A contains 2 units of protein and 1 unit of fat.
Food B contains 1 unit of protein and 2 units of fat.
The minimum requirement is 8 units of protein and 6 units of fat.
Food A costs ₹3 per unit, and Food B costs ₹2 per unit.
Let x = number of units of Food A Let y = number of units of Food B
Objective Function: Minimize Z = 3x + 2y
Constraints:
2x + y ≥ 8 (Protein Requirement)
x + 2y ≥ 6 (Fat Requirement)
x ≥ 0, y ≥ 0
Graphical Solution: Plot the constraints on a graph. Identify the feasible
region, find the corner points, and calculate Z at each point.
Assume corner points are:
A(0, 4), B(2, 2), C(4, 0)
Evaluate Z:
Z at A(0,4) = 3(0) + 2(4) = 8
Z at B(2,2) = 3(2) + 2(2) = 10
Z at C(4,0) = 3(4) + 2(0) = 12
Minimum Cost is ₹8 at (0,4).
6. Problem 2: Manufacturing Problem
Objective: Maximize profit.
A company produces two products, P1 and P2.
Each unit of P1 requires 2 hours of machine time and 1 hour of
labor.
Each unit of P2 requires 1 hour of machine time and 2 hours of
labor.
Total machine time available is 16 hours.
Total labor time available is 12 hours.
Profit per unit of P1 is ₹40, and for P2 is ₹50.
Let x = number of units of P1 Let y = number of units of P2
Objective Function: Maximize Z = 40x + 50y
Constraints:
2x + y ≤ 16 (Machine Time)
x + 2y ≤ 12 (Labor Time)
x ≥ 0, y ≥ 0
Graphical Solution: Plot the constraints on a graph. Identify the feasible
region, find the corner points, and calculate Z.
Assume corner points are:
A(0,0), B(4,0), C(2,5), D(0,6)
Evaluate Z:
Z at A = 0
Z at B = 40(4) + 50(0) = 160
Z at C = 40(2) + 50(5) = 80 + 250 = 330
Z at D = 40(0) + 50(6) = 300
Maximum Profit is ₹330 at (2,5)
7. Conclusion
This project illustrates how Linear Programming provides a powerful
mathematical framework to make optimal decisions in practical scenarios.
By converting real-life conditions into mathematical inequalities and
solving them graphically, we can arrive at the most efficient solutions
within given constraints. The Diet Problem showcases how to meet
nutritional requirements at minimum cost, which is beneficial for health
professionals and institutions planning meals. The Manufacturing Problem
highlights how industries can maximize profits while considering
production limitations. Through this exercise, we also learn how
mathematical logic contributes to rational thinking and strategic planning,
thereby bridging the gap between academic theory and real-world
application.
8. Bibliography
ISC Mathematics Textbook, Class 12
https://byjus.com/maths/linear-inequalities
NCERT Mathematics Class 12 – Chapter on Linear Programming
RS Aggarwal Mathematics for Class 12
Self-prepared graphical solutions
