Scribd
Upload
32 views11 pages

Maths Project2

Uploaded by

krishna agarwal
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
32 views11 pages

Maths Project2

Uploaded by

krishna agarwal
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/ 11

Page |1

MATHS
PROJECT-2
ISC MATHEMATICS
PROJECT-2
ISC 2020-21

Submitted by: Ojal Jain


Submitted by - Vidhee More
12-B
XII A
Page |2

ACKNOWLEDGEMENT

I would like to express my sincere gratitude to our Maths educator,


Mr.Aman Shahu and Mr.Ashutosh Aggarwal for giving me the golden
opportunity to do this project and also for his guidance and support.

I would also like to extend my gratitude to my parents and friends for


their constant support which helped me in completing this project within
the given time period.
Page |3

CONTENT

SL. NO. PARTICULARS PAGE NO.


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

TOPIC
Using suitable data, find the Optimum Cost by formulating linear
programming problem.
Page |5

PRE REQUISITE KNOWLEDGE

• Basic concept of solving linear inequalities, system of linear


equations and find the point of intersection.

• Concept of plotting system of linear equations graphically and find


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

• Concept of origin satisfaction for a given set of linear inequations.


Page |6

THEORY

Let and b be any real number, and of the 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 co-ordinates of some corner point.
Similarly, if ax + by has a minimum (least) value over the region , then a minimum
occurs for the co-ordinates of some corner point.

OBJECTIVE FUNCTION:
The linear function ax + by + c whose maximum or minimum value is determined
is called Objective function. In denoted by Z .

CONSTRAINTS:
The system of inequations or equations involving the variables of a LPP which
describe the conditions under which the optimization is to be attained are called
constraints. The constraints in a Linear Problem Involve the sign ≤ , = or ≥.

Non- negativity Constraints:


The variables involved in a LPP are non - negative.

Feasible region and Feasible solution:


The common region determined by all the constraints of an LPP is called a feasible
region and every point in this region is called a feasible solution to LPP.

Optimal Feasible solution:


A feasible solution of an LPP is said to be an optimal feasible solution if it also
optimizes (maximizes or minimizes) the objective function.
Page |7

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 maximise 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

А 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 ≤ 7600
Constraint (ii): Availability of men = 72

12x + 8y ≤ 72
Constraint (iii): Since the number of machines cannot be negative, therefore
x ≥ 0 and y ≥ 0
Page |8

Mathematical formulation

Maximize Z = 50x + 40y


Subject to the constraints:
1000x + 1200y ≤ 7600 = 5x + 6y ≤ 38
12x + 8y ≤ 72 = 3x + 2y ≤ 18

X ≥ 0, y≥ 0
Region represented by the inequations:.
5x + 6y = 38

x 0 7.6
19
y = 6.3 0
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 ≤ 38 , then
0 + 0 ≤ 38 , which is true. We shade the half plane containing the origin.

(ii) Put x = 0 , y = 0 in 3x +2 ≤ 18 , then


0 + 0 ≤ 18 , which is true. We shade the half plane containing the origin.
Shade the region represented by the inequations (2) to (4).
P a g e | 10

CONCLUSION

Linear programming finds application in almost all areas of human life. It is used to study
and evolve strategies, to cause maximum damages to the enemy at minimum cost and
loss. Linear programming helps us in achieving maximum output, maximum profit,
maximum return on investments, evolving least costing transportation routes.

Limitations
1. The 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.

2. Linear programming techniques are applicable when all the elements related to a
problem can be quantified. The qualitative factors such as human relations, behaviours,
credibility, etc. which are also important are not taken into account.
P a g e | 11

BIBLIOGRAPHY

To complete this project, I have taken help from:


1. ISC Mathematics Book II for class XII by O.P.Malholtra, S.K.Gupta, Anubhuti
Gangal.
2. ISC Mathematics Book II for class XI by O.P.Malholtra, S.K.Gupta, Anubhuti
Gangal.

You might also like