Class 12 Chapter 12 - Linear Programming

Exercise 12.1
Solve the following Linear Programming Problems graphically:
1. Maximise Z = 3x + 4y
subject to the constraints: x + y ≤ 4, x ≥ 0, y ≥ 0.
Sol. Maximise Z = 3x + 4y ...(i)
subject to the constraints:
x + y ≤ 4 ...(ii)
x ≥ 0, y ≥ 0 ...(iii)
Step I. Constraint (iii) namely x ≥ 0, y ≥ 0 ⇒ Feasible region
is in first quadrant. Y
Table of values for line x + y = 4
4 B(0, 4)
corresponding to constraint (ii)
3
x

x 0 4
+

2
y
=

y 4 0 1
4

So let us draw the line joining the X ′ O

X
1 2 3 4
points (0, 4) and (4, 0).
Now let us test for origin (x = 0, y =
0) in constraint (ii) x + y ≤ 4. This Y′

gives us 0 ≤ 4 which is true. Therefore region for constraint (ii)

is on the origin side of the line.
The shaded region in the figure is the feasible region determined
by the system of constraints (ii) and (iii). The feasible region
OAB is bounded.
Step II. The coordinates of the corner points O, A and B are (0, 0),
(4, 0) and (0, 4) respectively.
Step III. Now we evaluate Z at each corner point.
Corner Point Z = 3x + 4y
O(0, 0) 0
A(4, 0) 12
B(0, 4) 16 = M ← Maximum
Hence, by Corner Point Method, the maximum value of Z is 16
attained at the corner point B(0, 4).⇒Maximum Z = 16 at (0, 4).

MathonGo 1
 Class 12 Chapter 12 - Linear Programming

2. Minimise Z = – 3x + 4y
subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Sol. Minimise Z = – 3x + 4y ...(i)
subject to: x + 2y ≤ 8 ...(ii), 3x + 2y ≤ 12 ...(iii), x ≥ 0, y ≥ 0..(iv)
Step I. Constraint (iv) namely x ≥ 0, y ≥ 0 ⇒ Feasible region is
in first quadrant.
Table of values for line x + 2y = 8 of constraint (ii)
x 0 8
y 4 0

Let us draw the line joining the Y

points (0, 4) and (8, 0).
Now let us test for origin (0, 0) 7
in constraint (ii) which gives 0 ≤ 6 (0, 6)
8 which is true. 5
∴ Region for constraint (ii) is C(0, 4) 4 B(2, 3)
on the origin side of the line. 3 x+
2 2y
Table of values for line 3x + 2y =8
1 (8, 0)
= 12 of constraint (iii) A(4, 0)
X′ X
O 1 2 3 4 5 6 7 8
x 0 4

3x
y 6 0

+2
Y′

y=
Let us draw the line joining the

12
points (0, 6) and (4, 0).
Now let us test for origin (0, 0) in constraint (iii) which gives 0 ≤
12 and which is true.
∴ Region for constraint (iii) is also on the origin side of the line.
The shaded region in the figure is the feasible region determined
by the system of constraints from (ii) to (iv). The feasible region
OABC is bounded.
Step II. The coordinates of the corner points O, A and C are (0, 0),
(4, 0) and (0, 4) respectively.
Now let us find corner point B, intersection of lines
x + 2y = 8 and 3x + 2y = 12
4
Subtracting 2x = 4 ⇒ x = = 2.
2
Putting x = 2 in first equation 2 + 2y = 8
⇒ 2y = 6 ⇒ y = 3
∴ Corner point B is (2, 3)
Step III. Now let us evaluate Z at each corner point.
Corner Point Z = – 3x + 4y
O(0, 0) 0
A(4, 0) – 12 = m ← Minimum
B(2, 3) 6
C(0, 4) 16

MathonGo 2
 Class 12 Chapter 12 - Linear Programming

Hence, by Corner Point Method, the minimum value of Z is – 12

attained at the point A(4, 0).
⇒ Minimum Z = – 12 at (4, 0).
3. Maximise Z = 5x + 3y
subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0.
Sol. Maximise Z = 5x + 3y ...(i)
subject to:
3x + 5y ≤ 15 ...(ii)
5x + 2y ≤ 10 ...(iii)
x ≥ 0, y ≥ 0 ...(iv)
Step I. Constraint (iv) namely x ≥ 0 and y ≥ 0
⇒ Feasible region is in first quadrant.
Table of values for line 3x + 5y = 15 of constraint (ii)
x 0 5
y 3 0
Let us draw the line joining the
Y
points (0, 3) and (5, 0).
Let us test for origin (0, 0) in 6
constraint (ii) which gives (0, 5) 5
0 ≤ 15 and which is true. 4
∴ Region for constraint (ii) 20 , 45
C(0, 3) 3 B
19 19
contains the origin. 2 3x + 5
y = 15
Table of values for line 5x + 2y = 1
A(2, 0) (5, 0)
10 of constraint (iii). X′ X
O 1 2 3 4 5 6 7
5x

x 0 2
+2

y 5 0 Y′
y=
10

Let us draw the line joining the

points (0, 5) and (2, 0).
Let us test for origin (0, 0) in constraint (iii) which gives 0 ≤ 10 and
which is true.
∴ Region for constraint (iii) also contains the origin.
The shaded region in the figure is the feasible region determined by
the system of constraints from (ii) and (iv). The feasible region
OABC is bounded.
Step II. The coordinates of the corner points O, A and C are (0, 0),
(2, 0) and (0, 3) respectively.
Now let us find corner point B; intersection of lines
3x + 5y = 15 and 5x + 2y = 10
20
Ist eqn. × 2 – IInd eqn. × 5 gives – 19x = – 20 ⇒ x =
19

20 60
Putting x = in first eqn. ⇒ + 5y = 15
19 19

MathonGo 3
 Class 12 Chapter 12 - Linear Programming

60 285 − 60 225
⇒ 5y = 15 – = =
19 19 19
45  20 45 
⇒ y = . Therefore corner point B  , .
19  19 19 
Step III. Now we evaluate Z at each corner point.
Corner Point Z = 5x + 3y
O(0, 0) 0
A(2, 0) 10
 20 45  100 + 135 235
B ,  = =M ← Maximum
 19 19  19 19
C(0, 3) 9
235
Hence, by Corner Point Method, the maximum value of Z is
19
 20 45 
attained at the corner point B  , .
 19 19 
235  20 45 
⇒ Maximum Z = at  , .
19  19 19 
4. Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Sol. Minimise Z = 3x + 5y ...(i)
such that: x + 3y ≥ 3 ...(ii), x + y ≥ 2 ...(iii), x, y ≥ 0 ...(iv)
Step I. The constraint (iv) x, y ≥ 0 ⇒ Feasible region is in
first quadrant.
Table of values for line x + 3y = 3 of constraint (ii)
x 0 3
y 1 0
Let us draw the line joining the points (0, 1) and (3, 0).
Now let us test for origin (x = 0, y = 0) in constraint (ii) x + 3y ≥ 3,
which gives us 0 ≥ 3 and which is not true.
∴ Region for constraint (ii) does not contain the origin i.e., the
region for constraint (ii) is not the origin side of the line.
Table of values for line x + y = 2 of constraint (iii)
x 0 2
y 2 0
Let us draw the line joining the points (0, 2) and (2, 0).
Now let us test for origin (x = 0, y = 0) in constraint (iii),
x + y ≥ 2, which gives us 0 ≥ 2 and which is not true.
∴ Region for constraint (iii) does not contain the origin i.e., is
not the origin side of the line.
MathonGo 4
Class 12 Chapter 12 - Linear Programming

The shaded region in the figure is the feasible region determined

by the system of constraints from (ii) to (iv). The feasible region
is unbounded.
Step II. The coordinates of the corner points A and C are (3, 0)
and (0, 2) respectively.
Y

2 C(0, 2)

x
3x

+
+

y
5y

=
0, 7
=

2
1 3, 1
5 (0, 1) x+
3y 7 B
=3 2 2
A(3, 0)
X′ X
O 1 (2, 0)2 3
7 ,0
3

Y′

Now let us find corner point B, the point of intersection of lines

x + 3y = 3 and x + y = 2
1
Subtracting, 2y = 1 ⇒ y = .
2
1 1 3
Putting y = in x + y = 2, we have x = 2 – y = 2 – =
2 2 2
3 1
∴ Corner point B is  ,  .
2 2
Step III. Now, we evaluate Z at each corner point.
Corner Point Z = 3x + 5y
A(3, 0) 9

3 1 9 5
B ,  + = 7 = m ← Smallest
2 2 2 2
C(0, 2) 10
From this table, we find that 7 is the smallest value of Z at the
3 1
corner B  ,  . Since the feasible region is unbounded, 7 may or
2 2
may not be the minimum value of Z.
Step IV. To decide this, we graph the inequality Z < m
i.e., 3x + 5y < 7. 7
Table of values for line 3x + 5y = 7 x 0
3
corresponding to constraint 3x + 5y < 7
7
Let us draw the dotted line joining the y 0
5

MathonGo 5
 Class 12 Chapter 12 - Linear Programming

 7 7 
points  0,  and  , 0  . This line is to be shown dotted as
 5  3 
constraint involves < and not ≤, so boundary of line is to be
excluded.
Let us test for origin (x = 0, y = 0) in constraint 3x + 5y < 7, we
have 0 < 7 which is true. Therefore region for this constraint is on
the origin side of the line 3x + 5y = 7.
We observe that the half-plane determined by Z < m has no point
in common with the feasible region. Hence m = 7 is
3 1
the minimum value of Z attained at the point B  ,  .
2 2
3 1
⇒ Minimum Z = 7 at  ,  .
2 2
5. Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Sol. Maximise Z = 3x + 2y ...(i)
subject to:
x + 2y ≤ 10 ...(ii), 3x + y ≤ 15 ...(iii), x, y ≥ 0 ...(iv)
Step I. Constraint (iv) x, y ≥ 0 ⇒ Feasible region is in first
quadrant.
Table of values for the line x + 2y = 10 corresponding to
constraint (ii)
x 0 10
y 5 0
Let us draw the line joining the points (0, 5) and (10, 0).
Let us test for origin (x = 0, y = 0) in constraint (ii), we have 0 ≤ 10
which is true.
∴ Region for constraint (ii) is on the origin side of this line.
Table of values for line 3x + y = 15 corresponding to
constraint (iii)
x 0 5
y 15 0
Let us draw the line joining Y
the points (0, 15) and (5, 0).
Let us test for origin (x = 0, y 15 (0, 15)
= 0) in constraint (iii), we
have 0 ≤ 15 which is true. 10
∴ Region for constraint (iii)
is on the origin side of this
5
line. C(0, 5) B(4, 3)
The shaded region in the
(10, 0)
figure is the feasible region X′
O A(5, 0)
X
x+ 15
determined by the system of 2y
3x +

=1
constraints from (ii) to (iv). 0
y=

The feasible region OABC is Y′

15

bounded.

MathonGo 6
 Class 12 Chapter 12 - Linear Programming

Step II. The coordinates of the corner points O, A and C are (0, 0),
(5, 0) and (0, 5) respectively.
Now let us find corner point B, intersection of the lines
x + 2y = 10
and 3x + y = 15
First equation – 2 × second equation gives
– 5x = 10 – 30 ⇒ – 5x = – 20 ⇒ x = 4
Putting x = 4 in x + 2y = 10, we have
4 + 2y = 10 ⇒ 2y = 6 ⇒ y = 3
∴ Corner point B is B(4, 3).
Step III. Now we evaluate Z at each corner point.
Corner Point Z = 3x + 2y
O(0, 0) 0
A(5, 0) 15
B(4, 3) 18 = M ← Maximum
C(0, 5) 10
Hence, by Corner Point Method, the maximum value of Z is 18
attained at the point B(4, 3).
⇒ Maximum Z = 18 at (4, 3).
6. Minimise Z = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Show that the minimum of Z occurs at more than two
points.
Sol. Minimise Z = x + 2y ...(i)
subject to:
2x + y ≥ 3 ...(ii), x + 2y ≥ 6 ...(iii), x, y ≥ 0 ...(iv)
Step I. Constraint (iv) x, y ≥ 0 ⇒ Feasible region is in first
quadrant.
Table of values for the line 2x + y = 3 corresponding to
constraint (ii).
3
x 0
2
y 3 0
3 
Let us draw the line joining the points (0, 3) and  , 0  .
2 
Now let us test for origin (x = 0, y = 0) in constraint (ii) 2x + y ≥ 3,
we have 0 ≥ 3 which is not true.
∴ The region of constraint (ii) is on that side of the line which
does not contain the origin i.e., the region other than the origin
side of the line.
Table of values for the line x + 2y = 6 corresponding to
constraint (ii).
x 0 6
y 3 0
Let us draw the line joining the points (0, 3) and (6, 0).

MathonGo 7
Class 12 Chapter 12 - Linear Programming

Now let us test for origin (x = 0, y = 0) in constraint (iii) x + 2y ≥ 6,

we have 0 ≥ 6 which is not true.
∴ Region for constraint (iii) is the region other than the origin
side of the line i.e., region not containing the origin.
The shaded region in the figure is the feasible region determined
by the system of constraints from (ii) to (iv). The feasible region
is unbounded.
Step II. The coordinates of the corner points A and B are (6, 0)
and (0, 3) respectively.
Y

4 x + 2y > 6

B(0, 3)
x+
2 2y
= 6
1 x + 2y < 6

X′ X
O 1 2 3 4 5 A(6, 0)
2x

3 ,0
+
y=

2
3

Y′

Step III. Now, we evaluate Z at each corner point.

Corner Point Z = x + 2y
A(6, 0) 6
= m ← Smallest
B(0, 3) 6
From this table, we find that 6 is the smallest value of Z at
each of the two corner points. Since the feasible region is
unbounded, 6 may or may not be the minimum value of Z.
Step IV. To decide this, we graph the inequality Z < m i.e.,
x + 2y < 6.
The line x + 2y = 6 for this constraint Z < m (⇒ x + 2y < 6) is the
same as the line AB for constraint (iii).
Let us test for origin (x = 0, y = 0) for this constraint, we have 0 < 6
which is true.
Therefore region for this constraint is the (half-plane on) origin
side of this line.
Points on the line segment AB are included in the feasible region
and not in the half-plane determined by x + 2y < 6.
We observe that the half-plane determined by Z < m has no point
in common with the feasible region. Hence m = 6 is the minimum
MathonGo 8
 Class 12 Chapter 12 - Linear Programming

value of Z attained at each of the points A(6, 0) and B(0, 3).

⇒ Minimum Z = 6 at (6, 0) and (0, 3).
Remark. In fact, Z = 6 at all points on the line segment AB for
 5  3
example  1,  , (2, 2),  3,  etc.
 2  2
7. Minimise and Maximise Z = 5x + 10y subject to x + 2y ≤ 120, x + y
≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Sol. Minimise and Maximise Z = 5x + 10y ...(i)
subject to: x + 2y ≤ 120 ...(ii)
x + y ≥ 60 ...(iii), x – 2y ≥ 0 ...(iv), x, y ≥ 0 ...(v)
Step I. Constraint (v) x, y ≥ 0 ⇒ Feasible region is in first quadrant.
Table of values for line x + 2y = 120 of constraint (ii)
x 0 120
y 60 0
Let us draw the line joining the points (0, 60) and (120, 0).
Let us test for origin (x = 0, y = 0) in constraint (iii) x + 2y ≤ 120 we
have 0 ≤ 120 which is true.
∴ Region for constraint (ii) is on the origin side of the line
x + 2y = 120.
Table of values for line x + y = 60 of constraint (iii)
x 0 60
y 60 0
Let us draw the line joining the points (0, 60) and (60, 0).
Let us test for origin (x = 0, y = 0) in constraint (iii) x + y ≥ 60, we have
0 ≥ 60 which is not true.
∴ Region for constraint (iii) is the half-plane on the non-origin side
of the line x + y = 60 (i.e., on the side of the line opposite to the origin
side).
Table of values for line x – 2y = 0 of constraint (iv)
x 0 0 60
y 0 0 30
. .
( . The line x – 2y = 0 is
Y
passing through the origin,
so we have taken still
120
another point (60, 30) on
the line). 100
Let us draw the line joining 80
the points (0, 0) and (60, 30). (0, 60) = 0
60 2y
Let us test for (60, 0) x–
40
(a point other than origin) D(40, 20) C(60, 30)
in constraint (iv), we have 20
60 ≥ 0 which is true. X′ X
O 20 40 80 100
∴ Region for constraint x
A(60, 0) +
(iv) is the half-plane on that y B(120, 0)
=
60
side of the line which Y′
containing the point (60, 0).

MathonGo 9
 Class 12 Chapter 12 - Linear Programming

The shaded region in the figure is the feasible region determined

by the system of constraints from (ii) to (v). The feasible region
ABCD is bounded.
Step II. The coordinates of the corner points A and B are (60, 0)
and (120, 0) respectively.
Corner point C is the intersection of the line x – 2y = 0
i.e., x = 2y and x + 2y = 120. Putting x = 2y in x + 2y = 120,
we have 2y + 2y = 120 ⇒ 4y = 120
⇒ y = 30 and therefore x = 2y = 60.
∴ Corner point C (60, 30).
Similarly for corner point D, putting x = 2y in x + y = 60, we
have 2y + y = 60 ⇒ 3y = 60 ⇒ y = 20 and therefore x = 2y =
40. Therefore corner point D is (40, 20).
Step III. Now, we evaluate Z at each corner point.
Corner Point Z = 5x + 10y
A(60, 0) 300 = m ← Minimum
B(120, 0) 600
C(60, 30) 300 + 300 = 600 = M ← Maximum
D(40, 20) 400
Hence, by Corner Point Method,
Minimum Z = 300 at (60, 0)
Maximum Z = 600 at B(120, 0) and C(60, 30) and hence
maximum at all the points on the line segment BC joining the
points (120, 0) and (60, 30).
8. Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
Sol. Minimise and Maximise Z = x + 2y ...(i)
subject to:
x + 2y ≥ 100 ...(ii)
2x – y ≤ 0 ...(iii)
2x + y ≤ 200 ...(iv)
x, y ≥ 0 ...(v)
Step I. The constraint (v) x, y ≥ 0 ⇒ Feasible region is in first
quadrant.
Table of values for the line x + 2y = 100 for constraint (ii).
x 0 100
y 50 0
Let us draw the line joining the points (0, 50) and (100, 0).
Let us test for origin (x = 0, y = 0) in constraint (ii) x + 2y ≥ 100,
we have 0 ≥ 100 which is not true.
∴ Region for constraint (i) is that half-plane which does not
contain the origin.
Table of values for the line 2x – y = 0 i.e., 2x = y of
constraint (iii).
x 0 20
y 0 40

MathonGo 10
Class 12 Chapter 12 - Linear Programming

Let us draw the line joining the points (0, 0) and (20, 40).
Because this line passes through the origin, so we shall have the
test for some point say (100, 0) other than the origin.
Putting x = 100 and y = 0 in constraint (iii) 2x – y ≤ 0, we have
200 ≤ 0 which is not true.
∴ Region for constraint (iii) is the half plane on the side of the
line which does not contain the point (100, 0).
Table of values for the line 2x + y = 200 of constraint (iv).
x 0 100
y 200 0
Let us draw the line joining the points (0, 200) and (100, 0).
Let us test for origin (x = 0, y = 0) in constraint (iv) 2x + y ≤ 200, we
have 0 ≤ 200 which is true. Therefore region for constraint (iv) is the
half-plane on origin side of the line.
The shaded region in the figure is the feasible region determined
by the system of constraints from (ii) to (v). The feasible region
ABCD is bounded.
Step II. The coordinates of the two
corner points are C(0, 200) and Y
D(0, 50). 200 C(0, 200)

0
y=
Corner point A is the intersection

–
of boundary lines x + 2y = 100 and 150

2x
2x – y = 0 i.e., y = 2x.
Solving them, putting y = 2x, x + 100 B(50, 100)
4x = 100
⇒ 5x = 100 ⇒ x = 20. D(0, 50) A(20, 40)
∴ y = 2x = 2 × 20 = 40. (100, 0)
Therefore corner point A(20, 40). X′ X
O 50
Corner point B is the intersection x +150
2x

2y
=1
+

of the boundary lines 2x + y = 200 00

y=

Y′
and 2x – y = 0 i.e., y = 2x.
20

Solving them, putting y = 2x, 2x + 2x

0

= 200 ⇒ 4x = 200
⇒ x = 50 and therefore y = 2x = 100. Therefore corner point B is
(50, 100).
Step III. Now, we evaluate Z at each corner point.
Corner Point Z = x + 2y
A(20, 40) 100 = m ← Minimum
B(50, 100) 250
C(0, 200) 400 = M ← Maximum
D(0, 50) 100 = m ← Minimum
By Corner Point Method,
Minimum Z = 100 at all the points on the line segment joining
the points (20, 40) and (0, 50).
(See Step III, Example 7, Page 770.
Maximum Z = 400 at (0, 200).
MathonGo 11
 Class 12 Chapter 12 - Linear Programming

9. Maximise Z = – x + 2y, subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Sol. Maximise Z = – x + 2y ...(i)
subject to the constraints:
x ≥ 3 ...(ii), x + y ≥ 5 ...(iii), x + 2y ≥ 6 ...(iv), y ≥ 0 ...(v)
Step I. Constraint (v), y ≥ 0 ⇒ Positive side of y-axis
⇒ Feasible region is in first and second quadrants.
Region for constraint (ii) x ≥ 3.
We know that graph of the line x = 3 is a vertical line parallel
to y-axis at a distance 3 from origin along OX.
∴Region for x ≥ 3 is the half-plane on right side of the line x = 3.
Table of values for line x + y = 5 of constraint (iii)
x 0 5
y 5 0
Let us draw the line joining the points (0, 5) and (5, 0).
Let us test for origin (0, 0) in constraint (ii).
Putting x = 0 and y = 0 in x + y ≥ 5, we have 0 ≥ 5 which is not
true.
∴ Region for constraint (iii) is the half plane on the non-origin
side of the line x + y = 5.
Table of values for the line x + 2y = 6 of constraint (iii)
x 0 6
y 3 0
Let us test for origin (0, 0) in constraint (iv) x + 2y ≥ 6, we
have 0 ≥ 6 which is not true.
∴ Region for constraint
(iv) is again the half plane Y
on the non-origin side of
6
x=3

the line x + 2y = 6.
The shaded region in the 5 (0, 5)
– x + 2y > 1
x+

figure is the feasible 4

1
y=

(0, 3) y=
region determined by the 3 +2
5

x+ – x
system of constraints 2y =
from (ii) to (v). The 0, 1 2 6 C(3, 2)
2
B(4, 1)
feasible region is (– 1, 0) 1
unbounded. X′ X X
O 1 2 3 4 5 7
Step II. The coordinates A(6, 0)
of the corner point A are (5,0)
(6, 0). Y′
Corner point B is the
intersection of the boundary lines
x + y = 5 and x + 2y = 6
Let us solve them for x and y.
Subtracting the two equations 2y – y = 6 – 5 or y = 1.
Putting y = 1 in x + y = 5, we have x + 1 = 5 or x = 4. Therefore,
vertex B is (4, 1).
Corner point C is the intersection of the boundary lines x + y = 5
and x = 3.
MathonGo 12
 Class 12 Chapter 12 - Linear Programming

Solving for x and y; putting x = 3 in x + y = 5; 3 + y = 5 or y = 2.

Therefore corner point C is (3, 2).
Step III. Now, we evaluate Z at each corner point.
Corner Point Z = – x + 2y
A(6, 0) – 6
B(4, 1) – 2
C(3, 2) 1 = M ← Maximum
From this table, we find that 1 is the maximum value of Z at (3, 2).
Step IV. Since the feasible region is unbounded, 1 may or may
not be the maximum value of Z. To decide this, we graph
the inequality Z > M i.e., – x + 2y > 1.
Table of values for the line – x + 2y = 1 corresponding to
constraint Z > M i.e., – x + 2y > 1.
x 0 – 1
1
y 0
2
 1
0,
Let us draw the dotted line joining the points  2  and (– 1, 0).
The line is to be shown dotted because boundary of the line is to
be excluded as equality sign is missing in the constraint Z > M.
We observe that the half-plane determined by Z > M has points in
common with the feasible region. Therefore, Z = – x + 2y has no
maximum value subject to the given constraints.
10. Maximise Z = x + y,
subject to x – y ≤ – 1, – x + y ≤ 0, x, y ≥ 0.
Sol. Maximise Z = x + y ...(i)
subject to:
x – y ≤ – 1 ...(ii), – x + y ≤ 0 ...(iii), x, y ≥ 0 ...(iv)
Step I. Constraint (iv) x, y ≥ 0.
⇒ Feasible region is in first quadrant.
Table of values for the line x – y = – 1 of constraint (ii)
x 0 – 1
y 1 0
Let us draw the straight line joining the points (0, 1) and
(– 1, 0).
Let us test for origin (0, 0) in constraint (ii) x – y ≤ – 1, we
have 0 ≤ – 1 which is not true.
Therefore region for constraint (ii) is the region on that side of
the line which is away from the origin (as shown shaded in the
figure)
Table of values for the line – x + y = 0 i.e., y = x of
constraint (iii)
x 0 2
y 0 2
Let us draw the line joining the points (0, 0) and (2, 2).
Let us test for the point (2, 0) (say) [and not origin as line passes
through (0, 0)] in constraint (iii) – x + y ≤ 0, we have – 2 ≤ 0 which
is true.
MathonGo 13
Class 12 Chapter 12 - Linear Programming

∴ Region for constraint Y

(iii) is towards the point
(2, 0) side of the line

)
–1

,2
1
(shown shaded in the –

(2
=

y<
2

0
figure). y

=
–

x–
x

y
From the figure, we 0

+
<

x
observe that there is no 1 (0, 1) y

–
+
x
point common in the two – (2, 0)
shaded regions. Thus, the X′ X
(– 1, 0) O 1 2
problem has no feasible
region and hence no
feasible solution i.e., no
Y′
maximum value of Z.

MathonGo 14