0% found this document useful (0 votes)
29 views6 pages

Linear Programming Problems - 2022

The document contains a series of linear programming problems with graphical solutions, focusing on maximizing and minimizing objective functions subject to given constraints. It includes definitions of key concepts such as feasible region, linear objective function, optimal solution, and constraints, along with step-by-step solutions to various example problems. The document also provides specific corner points and corresponding values for the objective functions at those points.

Uploaded by

Sahil Killedar
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
0% found this document useful (0 votes)
29 views6 pages

Linear Programming Problems - 2022

The document contains a series of linear programming problems with graphical solutions, focusing on maximizing and minimizing objective functions subject to given constraints. It includes definitions of key concepts such as feasible region, linear objective function, optimal solution, and constraints, along with step-by-step solutions to various example problems. The document also provides specific corner points and corresponding values for the objective functions at those points.

Uploaded by

Sahil Killedar
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/ 6

II P U C MATHEMATICS April-May - 2022

Sree Guru SIX MARK QUESTIONS


Amma
LINEAR PROGRAMMING Ex: Solve the following problem
PROBLEMS graphically: Maximize and minimize
z  3x  2 y subject to constraints x  2 y  10,
1-M+6-M=7 Marks
3x  y  15, x, y  0 .

ONE MARK QUESTIONS Solution: Region represented by x  2 y  10


x y
  1
Ex: Define feasible region. Consider x  2 y  10 …(1) 10 5
Solution: A set of values of the variables  (1) passes through A (10, 0) and
satisfying all the constraints is known as a B (0, 5). Join AB and produce it both
feasible region. ways.
Ex: In Linear programming problems, Put x  0, y  0  0  0  10 which is true.
define linear objective function.  Solution region contains the origin.
Solution: Linear function z  ax  by , Region represented by 3x  y  15
where a, b are constant, which has to be 
x y
 1
maximised or minimized is called a linear Consider 3x  y  15 …(2) 5 15
objective function.  (2) passes through C (5, 0) and
D (0,15).join CD and produce it both ways.
Ex: Define optimal solution in a linear Put x  0, y  0  0  0  15 which is true.
programing problem.  Solution region contains the origin.
Solution: Any point in the feasible region Solve (1) and (2) x  4, y  3  E (4, 3)
that gives the optimal value (maximum or
minimum) of the objective function is
called an optimal solution linear
programing problem.
“OR”
The maximum or minimum values of the
objective function are called optimal
solution.
Solution lies in the region OBEC.
Ex: Define Constraints in Linear
programming problems. Corresponding
Solution: The set of points satisfying the Sl. Corner
value of a
No. points z  3x  2 y
constraints of an LPP is said to be
constrained set of LPP. 1. O (0, 0) O
2. B (0, 5) 10 Minimum
3. E (4, 3) 18  Maximum
4. C (5, 0) 15
Hence, maximum value of z is 18 at the
point (4, 3) and Minimum value of z is 10
at the point (0, 5).

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 1


II P U C MATHEMATICS April-May - 2022
Ex: Miximise z  4 x  y subject to Ex: Minimize z  3x  4 y subject to
Constraints x  y  50, 3x  y  90, the constraints x  2 y  8 3x  2 y  12
x  0, y  0 by graphical method. x  0, y  0 , by graphical method.
Solution: Region represented by x  y  50 
Solution: Region represented by x  2 y  8
Consider x  y  50 …(1)
Consider x  2 y  8 …(1)
Put x  0  y  50  A(0, 50)
Put x  0  y  4  A (0, 4)
Put y  0  x  50  B(50,0)
Put y  0  x  8  B (8, 0)
Plot the points A (0, 50) and B (50, 0). Join
AB and produce it both ways. Plot the points A (0, 4) and B (8, 0). Join
AB and produce it both ways.
Clearly O (0, 0) satisfies x  y  50 
Put x  0, y  0  0  0  8 which is true.
 Solution region is on origin side.
 Solution region contains the origin.
Region represented by 3x  y  90
Region represented by 3x  2 y  12
Consider 3x  y  90 …(2)
Consider 3x  2 y  12 ..…(2)
If x  0 then y  90  C (0,90)
Put x  0  y  6  C (0, 6)
If y  0 then x  30  D(30,0)
Put y  0  x  4  D (4, 0)
Put x  0, y  0 then 0  0  90 which is true.
Therefore solution region contains the Plot the points C (0, 6) and D (4, 0). Join
origin. CD and produce it both ways.
Solve (1) and (2), we get x  20, y  30 Put x  0, y  0  0  0  12 which is true.
 E(20,30)  Solution region contains the origin.
Solve (1) and (2) we get x  2 and y  3
E (2, 3).

 Solution lies in the region OAED. Solution lies in the region OAED.
Sl. Corresponding Corresponding
Corner points Sl. Corner
No. value of z  4 x  y No. points value of z  3x  4 y

1. O (0, 0) 0 1. O (0, 0) 0

2. A (0, 50) 50 2. A (0, 4) 16

E (20, 30) 110 3. E (2, 3) 6


3.
4. D (4, 0)  12  Minimum
4. D (30, 0) 120  Maximum
Hence, minimum value of z is  12 at the
Hence, maximum value of Z is 120 at the point (4, 0).
point (30, 0).

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 2


II P U C MATHEMATICS April-May - 2022
Ex: Solve the following problem Ex: Minimize and Maximize z  x  2 y
graphically: Maximize and minimize subject to the constraints x  2 y  100,
z  10500 x  9000 y subject to constraints
2 x  y  0, 2 x  y  200, x, y  0 by the
x  y  50 , 2 x  y  80 , x  0 , y  0 .
Solution: From the given data, graphical method.
z  10500 x  9000 y subject to the Solution: Minimize and Maximize,
constraints: x  y  50 , 2 x  y  80 x, y  0
z  x  2y
Region represented by x  y  50
Consider x  y  50 …(1) Draw the graph of the line x  2 y  100
It passes through A (50, 0) and B (0, If x  0 when y  50 and x  100 when y  0
50). Join AB and produce it both ways.
Put x  0, y  0  0  0  50 is true. Putting (0, 0) in the inequality x  2 y  100 ,
 Solution region constrains the we have, 0  100 is false, so the half plane
origin.
is away from the origin.
Region represented by 2 x  y  80
Consider 2 x  y  80 …(2) Secondly, draw the graph of the line
x y 2x  y  0
  1
40 80 Then x  0; y  0 and x  10; y  20
 It passes through C (40, 0) and D (0,
80). Join CD and produce it both ways. Putting (1, 1) in the inequality 2 x  y  0 ,
Put x  0, y  0  0  0  80 is true.
we have 1  0 is false, so the half plane is
 Solution region contains the origin.
Solve (1) and (2) we get x  30 and y  20 towards y  axis .
 E (30, 20) Thirdly, draw the graph of the line
2 x  y  200

Then x  0; y  200 and x  100; y  0


Putting (0, 0) in the inequality 2 x  y  200 ,
we have 0  200 is true, so the half plane
is towards the origin.
 Solution region is OBEC.
Sl. Corner Value of Since x, y  0 , so the feasible region lies in
No. point z  10500 x  9000 y the first quadrant.
1. O (0, 0) 0
On solving equations x  2 y  100 and
2. B (0, 50) 450000
3. E (30, 20) 495000  Maximum 2 x  y  0 , we get, (20, 40)
4. C (40, 0) 420000 Minimum On solving equations 2 x  y  0 and
2 x  y  200 , we get, (50,100) .
∴Minimum value of Z=420000 at the point
C (40, 0)
Maximum value of Z=495000 at the point
E (30, 20).

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 3


II P U C MATHEMATICS April-May - 2022
The corner points of the feasible region are No. Flour Fat
Type of required in required in
 0,50 ,  20, 40 , 50,100 and  0, 200 . cakes gms gms

I x 200 x 25 x

II y 100 y 50 y

Total x + y 200 x + 100 y 25 x + 50 y

 Total number of cakes z  x  y

such that 200 x  10 y  5000 (flour


constraints)
The values of Z at these points are as
25 x  50  1000 (fat constraints)
follows:
Hence mathematically, we have
Corner point z  x  2y
maximize z  x  y subject to constraints
(0,50) 100  Minimum
2 x  y  50, x  2 y  40, x, y  0
(20, 40) 100  Minimum
(50,100) 250 Region represented by 2 x  y  50

(0, 200) 400  Maximum x y


Consider 2 x  y  50 …(1)   1
25 50
The maximum value of Z is 400 at
 It passes through A (25, 0) and B (0,
(0, 200) and the minimum value of Z
50). Join AB and produce it both ways.
is 100 at all the points on the line
segment joining (0,50) and (20, 40) . Put x  0, y  0  0  0  50 is true.

 Solution region contains the origin.


Ex: One kind of cake requires 200 g of
Region represented by x  2 y  40
flour and 25 g of fat, and another kind of
Consider x  2 y  40 …(2)
cake requires 100 g flour and 50 g of fat.
x y
Find the maximum number of cakes   1
40 20

which can be made from 5 kg flour and 1 It passes through C (40, 0) and D (0, 20).

kg of fat assuming that there is no Join CD and produce it both ways.

Put x  0, y  0  0  0  40 is true.
shortage of the other ingredients, used in
 Solution region contains the origin.
making the cakes.
Solution: Let the number of cakes made Solve (1) and (2) we get x  20, y  10

of type I be x and that of type II be y.  E (20, 10) 

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 4


II P U C MATHEMATICS April-May - 2022
x y
Consider x  y  60 …(2)   1
60 60

 (2) passes through C (60, 0) and

B (0, 60). Join CB and produce it both


ways.

Put x  y  0  0  0  60 which is false.


 Solution region is ODEA.
 Solution region does not contain the
Sl.
Corner point Value of z  x  y origin.
No.
Region represented by x  2 y  0
1. O (0, 0) 0
Consider x  2 y  0 …(3)

2. D (0, 20) 20 It passes through the origin and

30  Maximum E (60, 30). Join OE and produce it both


3. E (20, 10)
ways.
4. A (25, 0) 25
Put x  30 and y = 0  30  0  0 which is

Hence, the maximum value of z is 30 at true.

E (20, 10). Solution region contains point (30, 0).

Ex: Minimize and maximize z  5x  10 y

subject to constraints x  2 y  120, x  y  60,

x  2 y  0, x, y  0 .

Solution: Region represented by


x  2 y  120 

x y Solution lies in the region CEDA.


Consider x  2 y  120 …(1)   1
120 60
Sl. Corner Value of
 (1) passes through A (120, 0) and No. point z  5x  10 y

B (0, 60). Join AB and produce it both 1. C (60, 0) 300  Minimum


ways.
2. E (40, 20) 400
Put x  0, y  0  0  0  120 which is true.
3. D (60, 30) 600 Maximum
 Solution region contains the origin.
4. A (120, 0) 600 Maximum
Region represented by x  y  60

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 5


II P U C MATHEMATICS April-May - 2022
Hence, minimum value of z is 300 at (60, If x = 1 then y = 1  E (1, 1)
0) and maximum value of z is 600 at all Plot the points F (2, 2) and E (1, 1). Join
the points on the line segment joining the EF and produce it both ways.
points A (120, 0) and D (60, 30). Clearly O (0, 1) satisfies x  y  0   (0, 1)
lies in the region x  y  0 
Ex: Minimize and maximize Z  3x  9 y, On solving x  y and x  y  10, we get the
subject to the constrains x  3 y  60; point G (5, 5)
x  y  10; x  y; x, y  0 . On solving x  y and x  3 y  60, we get the

Solution: Region represented by x  3 y  60 point H (15, 15).

Consider the equation x  3 y  60


Put x  0  y  20  A(0,20)
Put y  0  x  60  B(60,0)
Plot the points A (0, 20) and B (60,0). Join
AB and produce it both ways.
Putting x = 0 and y = 0, we get 0  3(0)  60 ,
is true.
 O (0, 0) lies in the region x  3 y  60  So, Thus, the feasible region is ACGH, as

the region containing the origin is the shown in the figure.

solution set of x  3 y  60 . Sl. Corner Corresponding


No. points value of z  3 x  9 y
Region represented by x  y  10 .
Consider the equation x  y  10 . 1. C (0, 10) 90
2. G (5, 5) 60  Minimum
Put x  0  y  10  C (0,10)
3. H (15, 15) 180 Maximum
Put y  0  x  10  D(10,0)
4. A (0, 20) 180 Maximum
Plot the points C (0, 10) and D (10, 0).
 The minimum value of Z is 60, and
Join CD and produce it both ways.
maximum value of Z is 180.
Now, x  0, y  0  0  0  10 , is not true.
 O (0, 0) does not lie in the region
@@@@@@@@@
x  y  10 .

Region represented by x  y i.e., x  y  0


Consider x  y i.e., x  y  0

If x  2 then y  2  F (2, 2)
Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 6

You might also like