lOMoARcPSD|42791497

Maths project 2 Final

Bsc. Economics (SVKM's NMIMS)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Jagriti Biswas ([email protected])
 lOMoARcPSD|42791497

Page|1

MATHEMATICS
PROJECT
ISC 2020-21

SUBMITTED BY:
MUDIT GARODIA

XII B

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|2

ACKNOWLEDGEMENT

I would like to express my sincere gratitude to my

Mathematics educators, Aman Shahu Sir and Ashutosh
Aggarwal sir for giving me the golden opportunity to do
this project and also for their guidance and support. I
would also like to thank them for giving me this
wonderful opportunity to do this project which has helped
me a lot in understanding the concepts better.
I would also like to extend my gratitude to my parents
and friends for their constant support which has helped
me in completing the project within the given time frame.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|3

CONTENT

SL. NO. PAGE NO.

PARTICULARS
1. TOPIC 4
2. PREREQUISITE KNOWLEDGE 5
3. THEORY 6-9
4. CONCLUSION 10
5. BIBLIOGRAPHY 11

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|4

TOPIC

Using suitable data, find the Optimum Cost by formulating

Linear Programming Problem.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|5

PREREQUISITE KNOWLEDGE

 Basic concept of solving linear inequalities, system of linear

equations and find the point of intersection.

 Concept of plotting system of linear equation graphically and

find the common region (feasible region) based on the given
conditions.

 Concept of origin satisfaction for a given set of linear

inequations.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|6

THEORY
Let a and b be any real number and let the linear expression
ax + by has a maximum (greatest) value over a feasible region that
is the intersection of finite number of closed half planes and has
corner points, then the maximum occurs for the coordinates of
some corner point .

Similarly, if ax + b y has a minimum (least) value over the region

then a minimum occurs for the coordinates of some corner point.

OBJECTIVE FUNCTION:

The linear function ax + by + c whose maximum or minimum

value is determined is called objective function. It is denoted by Z.

Constraints

The system of inequations or equations involving the variables of

a LLP which describe the conditions under which the optimization
is to be attained are called constraints. The constraints in a Linear
Programming Problem involved the sign,
f ,= or g .

Non-negativity Constraints

The variable involved in a LLP are non-negative.

Feasible region and Feasible solution

The common region determined by all the constraints of an LLP is

called a feasible region and every point in this region is called a
feasible solution to LLP.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|7

Optimal feasible solution

A feasible solution of an LLP is said to be an optimal feasible

solution if it also optimizes (maximizes or minimizes) the
objective function.

EXAMPLE:
A mill owner buys two types of machines A and B for his mill.
Machine A occupies 1000 sq m of area and requires
12 men to operate it, while machine B occupies 1200 sq m of
area and requires 8 men to operate it. The owner has 7600 sq
m of area available and 72 men to operate the machines. If
machine A produces 50 units and machine B produces 40 units
daily, how many machines of each type should he buy to
maximize the daily output? Use Linear Programming to find the
solution.

Solution: The given data can be put in the tabular form as:

Machine Area Number of men

A 1000 m2 12
B 1200 m2 8
Availability 7600 m2 72

Let the mill owner purchase x machines of type A and y machines

of type B. Then daily output of x machines of type A is =
50x units
Daily output of y machines of type B = 40y units
Total daily output = 50x + 40y
Let Z denote the maximum output, then
Z = 50x + 40y
Constraint (i): Area available for the machines = 7600
1000x + 1200 f 7600
Constraint (ii): Availability of men = 72
12x + 8y f 72
Constraint (iii): Since the number of machines cannot be
Downloaded by Jagriti Biswas ([email protected])
 lOMoARcPSD|42791497

Page|8
negative, therefore
x g 0 and y g 0

Mathematical formulation
Maximize
Z = 50x + 40y

Subject to the constraints:

1000x + 1200y f 7600 => 5x + 6y f 38
12x + 8y f 72 => 3x + 2y f 18
x g 0, yg 0

Region represented by the inequations:

5x + 6y = 38
x 0 7.6
y 19 0
3
= 6.3
Points A B

3x + 2y = 18
x 0 6
y 9 0
Points C D

We draw the lines 5x + 6y = 38 and 3x + 2y = 18 on suitable

scales:
(i) Put x = 0 , y = 0 in 5x + 6y f 38 , then
0 + 0 f 38 , which is true.
We shade the half plane containing the origin.
(ii) Put x = 0 , y = 0 in 3x +2 f 18 , then
0 + 0 f 18 , which is true.
We shade the half plane containing the origin.
Shade the region represented by the inequations (2) to (4).

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

Page|9
Corner Point Method
The coordinates of the vertices O, D, E, A of the feasible region
ODEAO are O(0,0) D(6,0), E(4,3) and A(0.63).
The coordinates of E are obtained by solving the equations 5x +
6 y= 38 and 3x+2y = 18.

The value of the objective function at these points are given in

the following table:
Corner points (x,y) of the Value of the objective
feasible region ODEAO function
Z = 50 + 40y
D(6,0) Z = 50(6) + 40(0) = 300
E(4,3) Z = 50(4) + 40(3) = 320
(Maximum)
A(0,6.3) Z = 50(0) + 40(6.3) = 252

Thus, Z is maximum when

x = 4 and y=3.
Hence, the mill owner should buy 4 machines of type A and 3
machines of type B to maximize the daily output.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

P a g e | 10

CONCLUSION
Linear Programming finds application in almost all areas of
human life. It helps us in achieving maximum outout, maximum
profit, maximum return on investments, evolving least costing
transportation routes etc. Applications of linear programming are
everywhere around us. We use linear programming at personal
and professional fronts. We are using linear programming when
we are driving from home to work and want to take the shortest
route. Or when we have a project delivery we make strategies to
make our team work efficiently for on-time delivery.
The main advantage of a linear programming approach is the
guaranteed solution of a well-formulated problem. Besides, it is
possible to solve a large-scale problem using linear
programming in a reasonable time. Also, it is the natural way to
start solving a complex optimization problem. Linear
Programming can be applied when the given information can be
expressed in terms of linear equations/inequations. There are
situations in real life when it is not always possible to do so.
Linear Programming techniques are applicable when all the
elements related to a problem can be quantified. The quantitative
factors such as human relations, behaviours, credibility, etc.
which are also important are not taken into account.

Downloaded by Jagriti Biswas ([email protected])

 lOMoARcPSD|42791497

P a g e | 11

BIBLIOGRAPHY

To complete this project, I have taken help from:

 ISC Mathematics Book I for class XI by
O.P.Malholtra, S.K.Gupta, Anubhuti Gangal.
 ISC Mathematics Book II for class XII by
O.P.Malholtra, S.K.Gupta, Anubhuti Gangal.
 https://www.ukessays.com/essays/management/i
-linear-programming.php
 https://www.uit.edu.mm/storage/2020/09/WWM
-2.pdf

Downloaded by Jagriti Biswas ([email protected])