Scribd
Upload
13 views7 pages

Linear Programming: Mathematics Project Report

dh

Uploaded by

darrendeepak2007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views7 pages

Linear Programming: Mathematics Project Report

dh

Uploaded by

darrendeepak2007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

LINEAR PROGRAMMING

Mathematics Project Report

DARREN DEEPAK
XII Science
INTRODUCTION
Linear Programming:
The term programming means “planning”, that is, the process of
determining a particular program. Linear programming is a mathematical technique
to find the optimum solution to and objective function of two or more variables
subject to a set of linear constraints. The term linear means that all relations among
the variables must be linear.
The general form of the objective function in two variables x and y
is z= c1x + c2y where c1 and c2 are coefficients for the decision variables x and y.
Here z may represent profit, cost or quantities produced and variables involved, in
the objective function may represent men, materials, machines lands, etc. In every
decision problem, there are certain restrictions in a decision-making environment.
Such restrictions are expressed by linear inequations and equations which are
called constraints. All decision variables are restricted to be non-negative, that is, x
≥ 0 and y ≥ 0 which are called non-negativity constraints.

Applications of linear programming:


• Engineering – It solves design and manufacturing problems as it is helpful
for doing shape optimisation
• Energy Industry – It provides methods to optimise the electric power system.
• Transportation Optimisation – For cost and time efficiency.
• Linear programming deals with maximising profit or minimising cost of
production in a business.

1
QUESTIONS AND ANSWERS
1. A company produces two types of presentation goods A and B that require
gold and silver.Each unit of type A requires 3g of silver and 1g of gold while that
of B requires 1g of silver and 2g of gold.The company can procure 9g of silver and
8g of gold.If each unit of type A brings a profit of Rs.40 and that of type B
Rs.50,determine the number of units of each type that should be produced to
maximise the profit.Indicate the feasible region on the graph.

Ans:
PRODUCT SILVER GOLD PROFIT (Rs)

3 1 40
A
$44

1 2 50
B

Ovjective: z = 40x + 50y (maximum profit)


Where x  no. of units of A
y  no. of units of B

3x + y ≤ 9 and x + 2y ≤ 8

When x=0,y=9 When x=0,y=4

y=0,x=3 y=0,x=8

On solving both the equations simultaneously we get x=2 and y=3

Thus we plot this in our graph and get the maximum value of z.

Corner points Value of Z = 40x + 50y

2
1. O (0,0) 40x0 + 50x0 = 0
2. A (3,0) 40x3 + 50x0 = 120
3. B (2,3) 40x2 + 50x3 = 230
4. C (0,4) 40x0 + 50x4 = 200
Hence maximum value of z is 230 which is attained at B (2,3). Therefore, for
maximum profit the company should produce 2 units of type A and 3 units of type
B goods.

3
2. A dietician wishes to mix two types of foods in such a way that vitamin
contents of the mixture contain atleast 8 units of vitamin A and 10 units of vitamin
C. Food ‘I’ contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food ‘II’
contains 1 unit/kg of vitamin A and 2 units/kg of vitamin C. It costs Rs 50 per kg to
purchase Food ‘I’ and Rs 70 per kg to purchase Food ‘II’. Formulate this problem
as a linear programming problem to minimise the cost of such a mixture.

Ans: the constraints are:

2x + y ≥ 8 x

+ 2y ≥ 10

Objective: Total cost Z of purchasing x kg of food I and y kg of Food II is Z = 50x


+ 70y, here we should minimise the value of Z in order to get the minimum of cost
of such a mixture

2x + y ≥ 8 and x + 2y ≥ 10

When x=0,y=8 and when y=0,x=4 When x=0,y=5 and when y=0,x=10

On solving both the equations simultaneously we get x=2 and y=4 .

4
Thus we plot this in our graph and get the minimum value of z.

corner points Value of Z = 50x + 70y

A (0,8) 50x0 + 70x8 = 560

B (2,4) 50x2 + 70x4 = 380

C (10,0) 50x10 + 70x0 = 500

Hence minimum value of z is 380 which is attained at B (2,4). Therefore, for


minimum cost of production the dietician should mix 2kg of food I and 4kg of food
II.

BIBLIOGRAPHY
1. ISC Class 12 Mathematics Textbook
2. https://byjus.com
3. www.shaalaa.com

5
ACKNOWLEDGEMENT
I would like to express my sincere gratitude to all individuals for
mentoring and supporting me in this project. I would like to
thank the mathematics department of my school, Hari Sri Vidya
Nidhi, for their invaluable insights and directions. I am grateful
to my parents for providing me with all the resources and
constant encouragement. I would also like to thank my friends
who supported me throughout the completion of this project.

You might also like