Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

Graph _ Linear Programming

The document outlines the formation and solving of Linear Programming Problems (LPP) involving various scenarios such as mixing foods for nutritional requirements, manufacturing tennis rackets and cricket bats, and minimizing transportation costs between godowns and shops. It includes specific constraints and objectives for each problem, providing equations to minimize costs or maximize profits. The document also illustrates graphical solutions and feasible regions for the LPPs presented.

Uploaded by

Ankit
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Graph _ Linear Programming

The document outlines the formation and solving of Linear Programming Problems (LPP) involving various scenarios such as mixing foods for nutritional requirements, manufacturing tennis rackets and cricket bats, and minimizing transportation costs between godowns and shops. It includes specific constraints and objectives for each problem, providing equations to minimize costs or maximize profits. The document also illustrates graphical solutions and feasible regions for the LPPs presented.

Uploaded by

Ankit
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Formation of LPP

1.Seema wishes to mix two type of food P and Q in such a way that the vitamin
contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B.
Food P costs Rs.60/kg and food Q costs Rs.80/kg. Food P contains 3 units/kg of
vitamin A and 5 units/kg of vitamin B while food Q contains 4 units/kg of vitamin A
and 2 units/kg of vitamin B. Form the LPP to minimise cost.

Soln Let x and y be the kgs of food P and Q.


Food P Food Q Requirement (≥)
VitaminA 3 4 8
VitaminB 5 2 11
Cost 60 80
LPP is
Minimise Cost z = 60x + 80y subject to the constraints
3x + 4y ≥ 8 , 5x + 2y ≥ 11, x ≥ 0 , y ≥ 0
Formation of LPP
2. A factory makes tennis rackets and criket bats. A tennis rackets takes 1.5 hours of
machine time and 3 hours of craftman's time in its making while a criket bat takes 3
hours of machine time and 1 hours of craftman's time. In a day the factory has the
availability of not more than 42 hours of machine time and 24 hours of craftman's time. If
the profit on a racket and on a bat is Rs.200 and Rs.100 respectively, form the LPP to
maximise profit.

Soln Let x & y be the no. of tennis racket and criket bat.

Racket Bat Availability (≤)


Machine time 1.5 3 42
Craftman time 3 1 24
Profit 200 100
LPP is
Maximise Profit z = 200x + 100y subject to
1.5x + 3y ≤ 42 , 3x + y ≤ 24, x ≥ 0 , y ≥ 0
Solving LPP
Solve Maximise z = 200x + 100y subject to the constraints
1.5x + 3y ≤ 42 , 3x + y ≤ 24, x ≥ 0 , y ≥ 0
Feasible region is the shaded region
Vertices are O,A,B and C
O=(0,0), A=(8,0) , B=(4,12) and C=(0,14)
At O , z = 200(0) + 100(0) = 0
At A , z = 200(8) + 100(0) = 1600
Maximum
C At B , z = 200(4) + 100(12) = 2000
B At C , z = 200(0) + 100(14) = 1400
Maximum z is 2000 at x=4 and y=12

O A
Solving LPP
Solve Minimise Cost z = 60x + 80y subject to the constraints
3x + 4y ≥ 8 , 5x + 2y ≥ 11, x ≥ 0 , y ≥ 0
Feasible region is the shaded region
Vertices are A,B and C
A A=(0,5.5) , B=(2,0.5) and C=(8/3,0)
At A , z = 60(0) + 80(5.5) = 440
Minimum
At B , z = 60(2) + 80(0.5) = 160
Minimum
At C , z = 60(8/3) + 80(0) = 160
Minimum cost is 160 on the line segment BC

B
C
Solving LPP
Solve graphically: Maximize z = 7x + 5y, subject to the
constraints
2x + y ≤ 100, 4x + 3y ≤ 240, x,y ≥ 0.
Solving LPP
Solve graphically: Maximize z = 7x + 5y, subject to the
constraints
2x + y ≤ 100, 4x + 3y ≤ 240, x,y ≥ 0.
Solving LPP
Solve graphically: Minimize z = 2x + 3y, subject to
x + 2y ≤ 40, 3x + y ≥ 30, 4x + 3y ≥ 60, x,y ≥ 0.
Solving LPP
Solve graphically: Minimize z = 2x + 3y, subject to
x + 2y ≤ 40, 3x + y ≥ 30, 4x + 3y ≥ 60, x,y ≥ 0.

40
The shaded region is the feasible region
with vertices A(15,0), B(40,0), C(4,18) & D(6,12)
30
At A, z=2(15)+3(0)=30
At B, z=2(40)+3(0)=80
20 C(4,18) At C, z=2(4)+3(18)=62
At D, z=2(6)+3(12)=48
D(6,12)
10 Mini. z=30 at x=15 & y=0

B(40,0)
A(15,0)
10 20 30 40 50
Solving LPP
Draw the graph to show the solution set S of the inequalities
3x + y ≥ 9, 4x + 3y ≥ 17, x ≥0 , y ≥ 0.
For what value of x and y over S, is the linear function 3x + 5y is
minimum ?
Solving LPP
Draw the graph to show the solution set S of the inequalities
3x + y ≥ 9, 4x + 3y ≥ 17, x ≥0 , y ≥ 0.
For what value of x and y over S, is the linear function 3x + 5y is
minimum ?

Minimum linear function is 12.75 at x = 17/4 & y = 0


Solving LPP
Solve graphically: Minimize and Maximize z = x + 2y, subject to
the constraints
x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x,y ≥ 0.
B(0,200)
200 (100,200)

100 C(50,100)
A(0,50)
D(20,40)

-200 -100 100 200 300


At A , z=0+2(50)=100 -100 Thus Max. z=400 at x=0 & y=200
At B , z=0+2(200)=400
At C , z=50+2(100)=250 -200 & minimum z=100 on the line
At D , z=20+2(40)=100 segment AD
Solving LPP
Solve the LPP Minimize and Maximise z = 5x + 10y subject to
the constraints
x + 2y ≤ 120 , x + y ≥ 60, x – 2y ≥ 0, x ≥ 0 , y ≥ 0
Forming and Solving LPP
A firm manufactures two products X and Y, each requiring the
use of three machines M1 , M2 and M3. The time required for
each product in hours and the total time available in hours on
each machine are as follows :
Machine Product X Product Y Available
time(in hrs.)
M1 2 1 70
M2 1 1 40
M3 1 3 90

If the profit is Rs.40 per unit for product X and Rs.60 per unit for
product Y , how many units of each products should be
manufactured to maximize profit ?
LPP is Maximize z = 40x + 60y , subject to
2x+y ≤70, x+y ≤40, x+3y ≤90, x,y ≥0
Forming and Solving LPP
A diet for sick person must contain at least 4000 units of
vitamins , 50 units of minerals and 1400 units of calories. Two
foods, A and B, are available at a cost of Rs.4 and Rs.3 per unit,
respectively. If one unit of A contains 200 units of vitamins, 1
unit of minerals and 40 units of calories; one unit of food B
contains 100 un its of vitamins, 2 units of minerals and 40 units
of calories, find what combination of food should be used to have
least cost?
Forming and Solving LPP
A diet for sick person must contain at least 4000 units of vitamins , 50 units of minerals
and 1400 units of calories. Two foods, A and B, are available at a cost of Rs.4 and Rs.3 per
unit, respectively. If one unit of A contains 200 units of vitamins, 1 unit of minerals and
40 units of calories; one unit of food B contains 100 un its of vitamins, 2 units of minerals
and 40 units of calories, find what combination of food should be used to have least cost?

Soln Let x and y be the units of food A and B.


Food A Food B Requirement (≥)
Vitamins 200 100 4000
Minerals 1 2 50
Calories 40 40 1400
Cost 4 3
LPP is
Minimise Cost z = 4x + 3y subject to the constraints
200x+100y ≥4000 , x+2y ≥50, 40x+40y≥1400 , x,y ≥ 0
Solving LPP
Solve graphically Minimize z = x – 5y + 20, subject to
x + y ≥ 0, -x +2y ≥ 2, x ≥ 3, y ≤ 4, x,y ≥ 0.
Solve graphically Minimize z = x – 5y + 20, subject to
x + y ≥ 0, -x +2y ≥ 2, x ≥ 3, y ≤ 4, x,y ≥ 0.

A(3,4)
4
C(6,4)

B(3,5/2)
2

-6 -4 -2 2 4 6

-2
At A, z= 3-5(4)+20= 3 ← Minimum
At B, z= 3-5(5/2)+20= 10.5
-4
At C, z= 6-5(4)+20= 6

Minimum z=3 at x=3 & y=4


Forming and Solving LPP
Two godown A and B have the grain storage capacity of 100
quintals and 50 quintals respectively. They supply to 3 shops D ,E
and F whose requirements are 60, 50 and 40 quintals
respectively. The costs of transportation per quintal from the
godown to the shops are given in the following table :
Transportation cost per quintal
From A B
D 6 4
E 3 2
F 2.5 3

How should the supplies be transported in order that the


transportation cost is minimum ?
Forming and Solving LPP x+y≤100
Two godown A and B have the grain storage capacity of 100
quintals and 50 quintals respectively. They supply to 3 shops D ,E
and F whose requirements arex≤6060, 50
y ≤ and
50 40 quintals
x+y≥60
respectively. The costs of transportation per quintal from the
godown to the shops are givenTransportation
in the following table :
cost per quintal
From A B
D 6x 4(60-x)
E 3y 2(50-y)
F 2.5(100-x-y) 3(x+y-60)

How should the supplies be transported in order that the


transportation cost is minimum ?
Minimize cost
x+y≤100, x≤60, y≤50, x+y≥60, x , y≥ 0
z = 6x+3y+2.5(100-x-y)+4(60-x)+2(50-y)+3(x+y-60), subject to

You might also like