KENDRIYA VIDYALAYA

IIT KHARAGPUR
MATHS INVESTIGATORY PROJECT

Name - Rohit Sasmal

Class - XII-B
Roll No - 12232
Session - 2023-24

TOPIC: LINEAR PROGRAMMING PROBLEMS RELATED

TO DAY – TO- DAY LIFE
 Contents
• Certificate.
• Acknowledgement.
• Introduction to Linear Programming
• Terminologies Related to Linear Programming
• Applications
 Certificate
This is to certify that this “Mathematics
Investigatory Project” on the topic “LINEAR
PROGRAMMING PROBLEMS RELATED TO
DAY – TO- DAY LIFE” has been successfully
completed by Rohit Sasmal of class XII-B under
the guidance of Mr. A.K. Majumdar (PGT
Math). This project work was carried out in
accordance with the requirement of the
Mathematics investigatory project for the
session 2023-24.

Principal Mr. A.K. Majumdar

KV IIT Kharagpur KV IIT Kharagpur

Acknowledgement
I would like to express my sincere gratitude to
Kendriya Vidyalaya Sangathan and Central
Board of Secondary Education for providing us
the opportunity to carry out this investigatory
project.
I am grateful to our Principal and our Math
teacher who guided me and made me
selfefficient to complete the project.
I would also like to thank my parents, friends
and Vidyalaya staff for their help in making our
project successful.

Introduction to Linear
Programming
In Mathematics, linear programming is a method of
optimizing operations with some constraints. The main
objective of linear programming is to maximize or
minimize the numerical value. It consists of linear
functions which are subjected to the constraints in the
form of linear equations or in the form of inequalities.
Linear programming is considered an important technique
that is used to find the optimum resource utilization. The
term “linear programming” consists of two words as
linear and programming. The word “linear” defines the
relationship between multiple variables with degree one.
The word “programming” defines the process of selecting
the best solution from various alternatives. The Linear
programming applications are present in broad disciplines
such as commerce, industry, etc.

Terminologies Related to
Linear Programming
• Objective function: - A linear function of the form Z =
ax + by, where a and b are constant, which has to be
minimized or maximized is called a linear objective
 function. Consider an example, Z = 175x + 150y. This is
a linear objective function. The variables x and y are
called decision variables.

• Constraints: - The linear inequalities or equations or

restrictions on the variables of LPP (linear programming
problem) are called constraints. The conditions x ≥ 0, y
≥ 0 are called nonnegative restrictions. For example, 5x
+ y ≤ 100; x + y ≤ 60 are constraints.

• Optimization problem: - A problem which seeks to

maximize or minimize a linear function (say of two
variables x and y) subject to certain constraints as
determined by a set of linear inequalities is called an
optimization problem. Linear programming problems
are special types of optimization problems.

• Feasible region: The common region determined by all

the given constraints including non-negative constraints
(x ≥ 0, y ≥ 0) of a linear programming problem is called
the feasible region (or solution region) for the problem.
The region other than feasible is called an infeasible
region.
• Feasible solutions: These are the points within and on
the boundary of the feasible region represent feasible
solutions of the constraints. Any point outside the
feasible region is called an infeasible solution.

• Optimal (or feasible) solution: Any point in the feasible

region that gives the optimal value (maximum or
minimum) of the objective function is called an optimal
solution.

Note: -
• A corner point of a feasible region is the point of
intersection of two boundary lines, which form the
region.
• A feasible region of a given system of linear inequalities
is said to be bounded if it can be enclosed within a
circle. Otherwise, it is unbounded. Unbounded means
that the feasible region may extend indefinitely in any
direction.

. APPLICATIONS
The following is an example: -
 Q) The weekly expenditures on food of different families
in my neighbourhood is given below: -
The weekly diet contains at least 30 units of proteins from
rice, 38 units of proteins from wheat and 24 units of
proteins from chicken

Amount of food item bought-

Families Type of food Rice Wheat Chicken

Family A Food-x 13 9 6
Family B Food-y 12 11 5

One KG of food - x costs Rs. 6 and one Kg of food y costs

Rs. 4. The diet should contain at least 4 KG of rice and 2
KG of wheat. Find the least cost of mixture that will
produce the diet.

Answer-
Let ‘x’ kg be amount of food ‘X’ and ‘y’ kg be amount of
food ‘Y’.
These two together comprises the diet.
Now, according to the given conditions, we can conclude
the following linear inequalities:
13x + 12y ≥ 30 ……. (I)
9x + 11y ≥ 38 ………. (II)
6x + 5y ≥ 4 ……………. (III)

Since, the quantity of food can never be negative.

Thus, x ≥ 0, y ≥ 0

It is given that one kg of food ‘X’ costs Rs. 6 and one kg of

food ‘Y’ costs Rs. 4.
So, ‘x’ kg of food ‘X’ and ‘y’ kg of food ‘Y’ will cost Rs.
(6x + 4y).
Thus, the given Linear Programming Problem is
Minimize: -
Z = 6x + 4y

Subject to,
13x + 12y ≥ 30
9x + 11y ≥ 38 6x
+ 5y ≥ 24 and, x
≥ 0, y ≥ 0

To solve this LPP, we draw the lines

13x + 12y = 30
9x + 11y = 38
6x + 5y = 24
 The coordinates of the vertices (corner points) of shaded
feasible region ABC are
A (38/9,0), B (148/42, 4/7) and C (0, 24/5)

These points have to be obtained by solving the equations

of the corresponding intersecting lines simultaneously. The
values of the Objective function at these points are given in
the following table: -

Point (x, y) Value of the Objective

Function- Z = 6x + 4y

A (38/9, 0) Z = 6×38/9 + 4×0 = 76/3 =

25.33
B (148/42, 4/7) Z = 6×148/42 + 4×4/7 = 164/7 = 23.42

C (0, 24/5) Z = 6×0 + 4×24/5 = 96/5 =

19.2

Clearly, Z is minimum at x = 0 and y = 24/5. The minimum

value of Z is 19.2.

We observe that the open half – plane represented by 6x +

4y > 19.2 does not have points in common with the feasible
region. So, Z has minimum value equal to 19.2.

Hence, the least cost of the diet is Rs. 19.2.