ISC Maths Project Shaurya Dalan LPP

ISC MATHEMATICS
PROJECT

NAME: Shaurya Dalan

CLASS: XII-C
UNIQUE ID: 7564672
ROLL NO.: 36
TOPIC: Linear Programming Problems

1|Page
ISC Maths Project Shaurya Dalan LPP

INTRODUCTION
Mathematics is the queen of science. In our daily life, planning is required on
various occasions, especially when the resources are limited. Any planning is
meant for attaining certain objectives. The best strategy is one that gives a
maximum output from a minimum input. The objective which is in the form of
output may be to get the maximum profit, minimum cost of production or
minimum inventory cost with a limited input of raw material, manpower and
machine capacity. Such problems are referred to as the problems of
constrained optimization. Linear programming is a technique for determining
an optimum schedule of interdependent activities in view of the available
resources. Programming is just another word for 'planning' and refers to the
process of determining a particular plan of action from amongst several
alternatives.
Linear programming applies to optimization models in which objective and
constraint functions are strictly linear. The technique is used in a wide range of
applications, including agriculture, industry, transportation, economics, health
systems, behavioral and social sciences and the military. It also boasts efficient
computational algorithms for problems with thousands of constraints and
variables. Indeed, because of its tremendous computational efficiency, linear
programming forms the backbone of the solution algorithms for other
operative research models, including integer, stochastic and non-linear
programming. The graphical solution provides insight into the development of
the general algebraic simplex method. It also gives concrete ideas for the
development and interpretation of sensitivity analysis in linear programming.
The word 'linear' means the relationships handled are those represented by
straight lines, i.e. the relationships are of the form y = a + bx and the word
'programming' means taking decisions systematically. Thus, linear
programming is a decisionmaking technique under given constraints on the
assumption that the relationships amongst the variables representing different
phenomena happen to be linear.

LPP- Related Terms

There exist specific terms (or terminology) while constructing and solving
linear programming problems. Let us define some of important terms which
we shall be using here:

2|Page
ISC Maths Project Shaurya Dalan LPP

1) 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. For example, Z = 175x + 150y is a linear objective
function. The variables x and y are called decision variables.

2) 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 non-negative restrictions. For example, 5x
+ y <= 100 x + y <= 60 are constraints.

3) 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.

4) 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.

5) Optimal solution: Any point in the feasible region that gives the
optimal value (maximum or minimum) of the objective function is called an
optimal solution.

6) Points Corner (Vertices): The points where the boundaries of the

feasible region intersect, often where optimal solutions are found.

LPP- Advantages
The advantages of linear programming include the following:

1. Linear programming assists in maximizing the utilization of useful

resources. It also shows how choosing and arranging these resources may
help a decision-maker use his productive factors efficiently.

3|Page
ISC Maths Project Shaurya Dalan LPP

2. Decision-making is improved by using linear programming techniques.

Utilizing this technique leads to a more objective and less subjective
decision-making process.
3. Linear programming approaches provide potential and workable solutions
since it's probable that there are external limitations at play that need to
be taken into account. The fact that we can create a lot of units does not
guarantee that they will sell. For the ease of the decision-maker, it is
therefore essential to modify the mathematical answer.
4. The most important benefit of this method is that it highlights
manufacturing process bottlenecks. For instance, when a bottleneck
happens, some machines can't keep up with demand while others are idle.
5. Re-evaluating a fundamental strategy for changing situations is made
easier with linear programming. The strategy can be adjusted to get the
greatest results if conditions change while it is partially implemented.

LPP- Limitations
1. Limited scope – Linear programming is only effective for solving certain
types of problems and may not be suitable for more complex or non-
linear situations.
2. Assumption of linearity – Linear programming relies on the assumption
that all relationships within a problem are linear, which may not always
be the case in real-world situations.
3. Sensitivity to errors – Even small errors in data or assumptions can have
a significant impact on the results of a linear programming problem,
reducing its accuracy.
4. Dependence on accurate data – The reliability of the results of a linear
programming model depends on the accuracy of the data used to
construct it, which may be difficult to obtain in some cases.
5. Difficulty in solving large-scale problems – Linear programming can
become increasingly complex and time-consuming to solve as the size
and scope of a problem grows, making it less practical for larger-scale
applications.
6. Integer Constraints - LP typically deals with continuous decision
variables, which may not be appropriate for problems where solutions
must be in whole numbers (integer values). In such cases, Integer Linear
Programming (ILP) or Mixed-Integer Linear Programming (MILP) may
be more appropriate.

4|Page
ISC Maths Project Shaurya Dalan LPP

7. Sensitivity to Data Changes - LP solutions can be sensitive to changes

in input data, and small variations in coefficients can result in different
optimal solutions. This sensitivity can be a drawback in cases of data
uncertainty.
8. No Time Consideration - LP does not consider time explicitly. Problems
involving dynamic or time-dependent decisions may require additional
modeling techniques, such as dynamic programming or integer
programming.

5|Page
ISC Maths Project Shaurya Dalan LPP

CASE STUDY

Linear Programming can be utilised to solve predicaments in the

Manufacturing sector as well. Here are a few examples to bolster this
assertion.

1) A Furniture dealer deals in only two items, table and chair. He has Rs. 5000
to invest and a space to store at most 60 pieces. A table costs him Rs. 250
and a chair Rs. 50. He can sell a table at a profit of Rs. 50 and a chair at a
profit Rs. 15. Assuming that he can sell all the items that he buys, how
should he invest his money in order that he may maximize his profit.

A) Let x and y be the number of tables and chairs.

Cost of x table = Rs. 250,
Cost of y chair = Rs. 50.

Since the dealer has maximum investment of Rs. 5000 and the maximum
number of items to be kept in store at 60, and the dealer want to sell a table
and chair at the profit Rs. 50 and Rs. 15 respectively. So, from the above
explanation, we get following mathematical form as follows: -

250x + 50y ≤ 5000 => 5x + y ≤ 100 ……. eq(1)

x + y ≤ 60, ................................................... eq(2)
x ≥ 0, y ≥ 0

and objective function Z = 50x + 15y

6|Page
ISC Maths Project Shaurya Dalan LPP

It is clear from the graph that OABC be

a feasible region, which is bounded. The
co-ordinates of corner points of feasible
region are O(0, 0), A(20, 0), B(10,50),
C(0,60). The co-ordinate of the point B
we get by solving equations (1) and (2).
Lastly, applying corner point method to
find maximum values of objective
function Z as follows:

Hence, the dealer gets a maximum profit of Rs. 1250 when he sells 10 tables
and 50 chairs.

2) A manufacturer makes two products, A and B. Product A sells at Rs. 200

each and takes 1 hour to make. Product B sells at Rs. 300 each and takes 1
2

hour to make. There is a permanent order for 14 units of product A and 16

units of product B. A working weck consists of 40 hours of production and
the weekly turnover must not be less than Rs. 10000. If the profit on each of
product A is Rs. 20 and on product B is Rs. 30, then how many of each
should be produced so that the profit is maximum? Also find the maximum
profit.

A) Let x and y be the number of units of products A and B respectively

manufactured. Hence, the total profit is derived to be P = 20x + 30y.

Thus, a LPP can be formulated as:

P = 20x + 30у where the constraints can be identified as-

200х + 300y ≥ 10000 i.e., 2x + 3y ≥ 100 (turnover constraint)

1 x + 1y ≤ 40 i.e., x + 2y ≤ 80 (time constraint)
2

7|Page
ISC Maths Project Shaurya Dalan LPP

x ≥ 14, y ≥ 16, x ≥ 0, y ≥ 0.

The shaded portion shows the feasible

region ABCD, which is bounded. The
corner points of the feasible region
ABCD are A (26, 16), B (48, 16), C
(14, 33) and D (14, 24).

At A, P = 20 × 26 + 30 × 16 = 1000.
At B, P = 20 × 48 + 30 x 16 = 1440.
At C, P = 20 × 14 + 30 × 33 = 1270.
At D, P = 20 x 14 + 30 × 24 = 1000.

Hence, the manufacturer should indulge in producing 48 units of product A and

16 units of product B. This is the most efficient alternative and will grant him
the maximum profit of Rs. 1440.

8|Page
ISC Maths Project Shaurya Dalan LPP

Linear Programming can be utilised to finding the optimum nutritional

value in diets as well. Here are a few examples to bolster this assertion.

1) A dietician has to develop a special diet using two foods P and Q. Each
packet (containing 30 g) of food P contains 12 units of calcium, 4 units
of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of
the same quantity of food Q contains 3 units of calcium, 20 units of
iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires
atleast 240 units of calcium, atleast 460 units of iron and at most 300
units of cholesterol. How Many packets of each food should be used to
maximize the amount of vitamin A in the diet? What is the maximum
amount of vitamin A in the diet?

Answer: - Let the dietician uses x packets of food P and y packets of Q.

we construct the following table:

9|Page
ISC Maths Project Shaurya Dalan LPP

10 | P a g e
ISC Maths Project Shaurya Dalan LPP

2) A diet is to contain at least 80 units of vitamin A and 100 units of

minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit
food and F2 costs Rs 6 per unit. One unit of food F1 contains 3 units of
vitamin A and 4 units of minerals. One unit of food F2 contains 6 units
of vitamin A and 3 units of minerals. Formulate this as a linear
programming problem. Find the minimum cost for diet that consists of
mixture of these two foods and also meets the minimal nutritional
requirements?

A) Let the diet contain x units of food F1 and y units of food F2.
Therefore,

x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follow:

11 | P a g e
ISC Maths Project Shaurya Dalan LPP

The cost of food F1 is Rs 4 per unit and of Food F2 is Rs 6 per unit.

Therefore, the constraints are:

3x + 6y ≥ 80

4x + 3y ≥ 100

x, y ≥ 0

Total cost of the diet, Z = 4x + 6y

The mathematical formulation of the given problem is Minimise

Z = 4x + 6y … (1)

subject to the constraints,

3x + 6y ≥ 80 … (2)

4x + 3y ≥ 100 … (3)

x, y ≥ 0 … (4)

The feasible region determined by the constraints is as follows.

12 | P a g e
ISC Maths Project Shaurya Dalan LPP

It can be seen that the feasible region is unbounded.

The corner points of the feasible region are A(8/3,0), B(2,1/2) and
C(0,11/2)

The corner points are A (80/3,0), B (24,4/3) and C (0,100/3) The

values of Z at these corner points are as follows:

13 | P a g e
ISC Maths Project Shaurya Dalan LPP

As the feasible region is unbounded, therefore, 104 may or may not be the
minimum value of Z.

For this, we draw a graph of the inequality, 4x + 6y < 104 or 2x + 3y < 52,
and check whether the resulting half plane has points in common with the
feasible region or not.

It can be seen that the feasible region has no common point with 2x + 3y <52
Therefore, the minimum cost of the mixture will be Rs 104.

14 | P a g e
ISC Maths Project Shaurya Dalan LPP

Linear Programming can be utilised to solve problems in finding the

optimum alternatives of Transportation of items as well. Here are a few
examples to bolster this assertion.

1) A brick manufacturer has two depots, A and B, with stocks of 30,000 and
20,000 bricks respectively. He receives orders from three builders P, Q
and R for 15,000, 20,000 and 15,000 bricks respectively. The cost in Rs
transporting 1000 bricks to the builders from the depots are given below:

FROM/TO P Q R
B 40 20 30
A 20 60 40

How should the manufacturer fulfil the orders to keep the cost of transportation
minimum?
Answer- Let the depot A transport x thousand bricks to builder P and y thousand
bricks to builder Q.

Then, the above LPP can be stated mathematically as follows:

Z = 30х - 30у + 1800 where the constraints can be identified as-

15 | P a g e
ISC Maths Project Shaurya Dalan LPP

x+y ≤ 30 x ≤ 15 y ≤ 20 x+ y ≥ 15 x≥ 0, y ≥ 0

The feasible region of the LPP is shaded and is bounded. The coordinates of the
corner points of the feasible region A2 P Q B3 B2 are A2 (15, 0), P (15, 15), Q
(10, 20), B3 (0, 20) and B2 (0, 15). These points have been obtained by solving
the corresponding intersecting lines simultaneously.

At A2 (15, 0), Z = 30 x 15 - 30 x 0 + 1800 = 2250.

At P (15, 15), Z = 30 x 15 - 30 x 15 + 1800 = 1800.

At Q (10, 20), Z = 30 x 10 - 30 x 20 + 1800 = 1500.

At В3 (0,20), Z = 30 x 0 - 30 x 20 + 1800 = 1200.

At B2 (0,15), Z = 30 x 0 - 30 x 15 + 1800 = 1350.

Clearly, Z is minimum at x = 0, y = 20 and the minimum value of Z is 1200.

16 | P a g e
ISC Maths Project Shaurya Dalan LPP

Thus, the manufacturer should supply 0, 20 and 10 thousand bricks to builders

P, Q and R from depot A and 15, 0 and 5 thousand bricks to builders P, Q and R
from depot B respectively. In this case the minimum transportation cost will be
Rs 1200.

2) A company has two factories located at P and Q and has three depots
situated at A, B and C. The weekly requirement of the depots at A, B and
C is respectively 5, 5 and 4 units, while the production capacity of the
factories at P and Q are respectively 8 and 6 units. The cost (in ₹) of
transportation per unit is given below.

Cost(in ₹)
A B C
To
From
P 160 100 150

Q 100 120 100

How many units should be transported from each factory to each depot in
order that the transportation cost is minimum?
ANS: We note that total weekly production (of P and Q) = 8 + 6 = 14 units, and
total weekly requirement at depots A, B, C = 5 + 5 + 4 = 14 units, so there is no
mismatch between supply and demand.
Let factory P supply x units per week to depot A and y units to depot B so that it
supplies 8 - x - y units to depot C. Obviously 0 ≤ x ≤ 5, 0 ≤ y ≤ 5, 0 ≤8 - x - y ≤
4.

17 | P a g e
ISC Maths Project Shaurya Dalan LPP

As depot A's requirement is 5 units and it receives x units from factory P, it must
receive (5 - x) units from factory Q. Similarly, depot B receives (5 - y) units
from factory Q and Depot C receives 4 - (8 - x - y) = x + y - 4 units from factory
Q.
The total transportation cost (in ₹) = 160x + 100y + 150(8 - x - y) + 100(5 - x) +
120(5 - y)+ 100(x + y- 4) = 10(х - 7y + 190).
Hence, the given problem can be formulated as an L.P.P. as:
We can find x and y which minimize Z = 10(x - 7y + 190) subject to the
constraints
x + y ≥ 4, x + y ≤ 8, x ≥ 0, x ≤ 5, y ≥ 0, y ≤ 5.
The feasible region corresponding to these inequalities is shown shaded in the
figure given on the next page.

It is the bounded (convex) region ABCDEF. We calculate the values of Z (in ₹)

at the six corner points:

18 | P a g e
ISC Maths Project Shaurya Dalan LPP

Point x y Z = 10(x-7y+190)
A 4 0 1940
B 5 0 1950
C 5 3 1740
D 3 5 1580
E 0 5 1550 (Minimum)
F 0 4 1620

We see that Z is minimum ₹1550 at point E (0, 5). Hence, x = 0, y = 5.

Thus, for minimum transportation cost, factory P should supply 0, 5, 3
units to depots A, B, C respectively and factory Q should supply 5, 0, 1
units respectively to depots A, B, C.

19 | P a g e
ISC Maths Project Shaurya Dalan LPP

CONCLUSION
In conclusion, our study of Linear Programming (LP) has revealed its
significance as a versatile mathematical tool for optimizing a multitude of
complex decision-making processes. LP provides a structured approach for
allocating limited resources efficiently while adhering to various constraints,
making it a crucial asset across diverse domains such as economics,
manufacturing, logistics, and more. Through this project, we have developed a
profound understanding of LP's fundamental concepts, including objective
functions, constraints, and the simplex method for solving LP problems. The
practical applications and case studies we've examined have underscored how
LP empowers us to make informed choices that lead to cost reduction, profit
maximization, and improved resource allocation. As we conclude this project,
we recognize that LP's relevance in addressing real-world challenges is more
pronounced than ever, making it a pivotal tool in decision-making processes
and mathematical modeling, promising to continue shaping the landscape of
optimization and efficiency in various industries. This project has not only
deepened our mathematical knowledge but also equipped us with valuable
problem-solving skills that will prove indispensable in our academic and
professional journeys.

20 | P a g e
ISC Maths Project Shaurya Dalan LPP

ACKNOWLEDGMENTS
I would like to express my heartfelt gratitude to my teacher Mr A.
Bandhopadhyay, whose valuable guidance and teaching has helped me in
completing this project. I would like to thank sir for giving me such an
opportunity to do this wonderful project, which also helped me in doing a lot of
research and I came to know about many new things.

I would also like to thank my school and Principal Sir, Dr. T. H. Ireland for
providing us with the facilities to continue our education even during this
pandemic. Finally, I would like to thank my parents for supporting me and
always staying by my side.

21 | P a g e
ISC Maths Project Shaurya Dalan LPP

BIBLIOGRAPHY
1) M. L. Aggarwal Class 12 Understanding ISC Mathematics
Volume – 2
2) R. D. Sharma Class 12 Mathematics

22 | P a g e