Scribd
Upload
19 views3 pages

CH 12 LP Sol

Uploaded by

krishnakarthik2357
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
19 views3 pages

CH 12 LP Sol

Uploaded by

krishnakarthik2357
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/ 3

PM SHRI KENDRIYA VIDYALAYA PITAMPURA SHIFT-1

CLASS-XII
CHAPTER-12 LINEAR PROGRAMMING
1 Maximum value of Z = 2x + 5y, subject to constraints :
2x + 4y ≤ 8; 3x + y ≤ 6; x + y ≤ 4; x ≥ 0, y ≥ 0
Given inequalities:
2x + 4y ≤ 8, 3x + y ≤ 6, x + y ≤ 4, x ≥ 0, y ≥ 0,
2𝑥 + 4𝑦 = 8 -------(i)
x 0 4
y 2 0
3𝑥 + 𝑦 = 6 -------(ii)
x 0 2
y 6 0
𝑥 + 𝑦= 4 -------(iii)
x 0 4
y 4 0
𝑥 ≥ 0, 𝑦 ≥ 0, (First quadrant)
On plotting the graph shaded
portion OABC is feasible region.
𝐴(2, 0), 𝐶(0, 2)
After solving equation (i) and
8 6
(ii) 𝐵 ( , )
5 5
Corner Point Value of 𝑍 = 2𝑥 + 5𝑦
𝐴(2, 0) 4
8 6 46
𝐵( , )
5 5 5
𝐶(0, 2) 10 Maximum
Hence, Z is maximum at C(0, 2), i.e. x = 0, y = 2,
Maximum Z = 10
2 Minimise and Maximise Z = 5x + 2y subject to constraints:
x – 2y ≤ 2 , 3x + 2y ≤ 12 , –3x + 2y ≤ 3 ,x ≥ 0, y ≥ 0
Given inequalities:
𝑥 – 2𝑦 ≤ 2, 3𝑥 + 2𝑦 ≤ 12, – 3𝑥 + 2𝑦 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0
𝑥 – 2𝑦 = 2, -------(i)
x 0 2
y -1 0
3𝑥 + 2𝑦 = 12, -------(ii)
x 0 4
y 6 0
– 3𝑥 + 2𝑦 = 3, -------(iii)
x 0 -1 3
y 1.5 0 6
𝑥 ≥ 0, 𝑦 ≥ 0 (First quadrant)
On plotting the graph shaded portion OABCD is feasible region.
𝐴(2, 0), 𝐷(0,1.5)
7 3 3 15
After solving (i) and (ii) 𝐵 ( , ) and by (ii) and (iii) 𝐶 ( , )
2 4 2 4
Corner Point Value of 𝑍 = 5𝑥 + 2𝑦
𝐴(2, 0) 10
7 3 19 Maximum
𝐵( , )
2 4
3 15 15
𝐶( , )
2 4
3 3 Minimum
𝐷 (0, )
2
7 3 7 3
Hence, Z is maximum at 𝐵 ( , ), i.e. x = , y =
2 4 2 4
Maximum Z = 19
3 3
Z is minimum at 𝐷 (0, ), i.e. x =0, y =
2 2
Minimum Z = 3
3 Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10 ,x + y ≥ 6, 3x + y ≥ 8 ,x, y ≥ 0
Given inequalities:
𝑥 + 2𝑦 ≥ 10 , 𝑥 + 𝑦 ≥ 6, 3𝑥 + 𝑦 ≥ 8 , 𝑥, 𝑦 ≥ 0
𝑥 + 2𝑦 = 10 -------(i)
x 0 10
y 5 0
𝑥 + 𝑦= 6 -------(ii)
x 0 6
y 6 0
3𝑥 + 𝑦 = 8 -------(iii)
x 0 8/3 5
y 8 0 1

𝑥, 𝑦 ≥ 0 (First quadrant)

On plotting the graph


shaded feasible solution is unbounded region and
𝐴(10, 0), 𝐵(2, 4), 𝐶(1, 5) 𝑎𝑛𝑑 𝐷(0, 8)
Corner Point Value of 𝑍 = 3𝑥 + 5𝑦
𝐴(10, 0) 30
𝐵(2,4) 26 Minimum
𝐶(1,5) 28
𝐷(0,8) 40
As region is unbounded, Draw 𝟑𝒙 + 𝟓𝒚 ≤ 𝟐𝟔
we notice there is no common point in region and 3𝑥 + 5𝑦 ≤ 26
Z is minimum at 𝐵(2, 4), i.e. x = 2, y = 4
Minimum Z= 26
4 Minimise and Maximise Z = 5x + 10y subject to the constraints:
𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 − 2𝑦 ≥ 0, 𝑥 ≥ 0, 𝑎𝑛𝑑 𝑦 ≥ 0
Minimum value of Z=300 at (60, 0) and
Maximum value of Z is 600 at all the points on the line segment
joining (120, 0) and (60, 30).
5 Maximise Z = 4x + y subject to the constraints:
𝑥 + 𝑦 ≤ 50 , 3𝑥 + 𝑦 ≤ 90 , 𝑥 ≥ 0, 𝑦 ≥ 0
Maximum value of Z is 120 at the point (30, 0).

6 Minimise Z = 200 x + 500 y subject to the constraints:


𝑥 + 2𝑦 ≥ 10 , 3𝑥 + 4𝑦 ≤ 24 , 𝑥 ≥ 0, 𝑦 ≥ 0
Minimum value of Z is 2300 attained at the point (4, 3)

7 Minimise and Maximise Z = 3x + 9y subject to the constraints:


𝑥 + 3𝑦 ≤ 60 , 𝑥 + 𝑦 ≥ 10 , 𝑥 ≤ 𝑦 , 𝑥 ≥ 0, 𝑦 ≥ 0
Maximum Z = 60 at all the points on the line segment joining the
points (15, 15) and (0, 20).
8 Minimise Z = 3x + 5y, subject to the constraints:
x + 3y ≥ 3, x + y ≥ 2, 𝑥 ≥ 0, 𝑦 ≥ 0 (Unbounded Region)

Minimum value of Z is 7 at point B (3 / 2, 1 / 2).

You might also like