Chapter

7 Linear Programming
Classical Thinking
7.1 Linear inequations in two variables
1. (A) Solution set of the given inequalities is {(x, y): x  0}  {(x, y): y  0}= {(x, y) : x  0, y  0} i.e., the set
of all those points whose both co-ordinates are non-negative.
All these points lie in the first quadrant (including points on +ve X-axis, +ve Y-axis and the origin).

2. (A) xy ≥ 0  (x ≥ 0 and y ≥ 0) or (x ≤ 0 and y ≤ 0)

ns
Now x ≥ 0, y ≥ 0 represents the first quadrant and x ≤ 0, y ≤ 0 represents the third quadrant.
3. (B) 4. (D)
7.2 Formulation of LPP

io
1. (B) 2. (B) 3. (C)
4. (B) ‘p’ is a linear inequality and ‘q’ is a non-linear inequality

at
5. (B) Since the profit should be maximum, the objective function is
Maximum profit, z = 40x + 25y. lic
6. (A) 7. (C) 8. (B)

9. (B) Let x = number of table clothes produced in a day, and

y = number of curtains produced in a day
 x  0, y  0
ub
…[ both items cannot be negative]
Representing the given information in tabular form, we get
Table cloth (x) Curtain (y) Minimum requirement
Money earned (`) 50 250 500
P

 50x + 250y  500

 Total hours = z = x + 3y
 Required LPP is formulated as
et

Minimize, z = x + 3y , subject to 50 x + 250 y  500, x  0 , y  0

7.3 Terminologies related to the solution of LPP, Solution of LPP by graphical method
rg

1. (C) In linear programming problem, concave region is not used. Convex region is used in linear programming.
2. (B)
Ta

3. (A) Feasible region lies on non-origin side of both lines and is true for positive values of x and both positive
and negative values of y. Y
3x  y = 3

X X
O (1,0)

(0,–3)
(0,–4)
4x  y = 4
Y
1
 

MHT-CET Triumph Maths (Solutions)

4. (D) At (800, 400), P = 12 (800) + 6 (400) = 12000
At (1050, 150), P = 12 (1050) + 6 (150) = 13500
At (600, 0), P = 12 (600) + 6 (0) = 7200
 Maximum value of P is 13500.
5. (B) The corner points of feasible region are O(0, 0), A(7, 0), B(3, 4) and D(0, 2)
At A(7, 0), z = 5(7) + 7(0) = 35
At B(3, 4), z = 5(3) + 7(4) = 43
At C(0, 2), z = 5(0) + 7(2) = 14
 Maximum value of z is 43.
6. (D) The corner points of feasible region are O(0, 0), A(25, 0), B(16, 16) and C(0, 24)
At O(0, 0), z = 0

ns
At A(25, 0), z = 4(25) + 3(0) = 100
At B (16, 16), z = 4(16) + 3(16) = 112
At C(0, 24), z = 4(0) + 3(24) = 72
 Maximum value of z is 112.

io
7. (D) At A (50, 50), P = 5 (50) + 3 (50) + 410 = 610
2 2
5 3
At B (10, 50), P = (10) + (50) + 410 = 510

at
2 2
At C (60, 0), P = 5 (60) + 3 (0) + 410 = 560
2 2 lic
5
At D (60, 40), P = (60) + 3 (40) + 410 = 620
2 2
 Minimum value of P is 510 at B (10, 50)
8. (C) The corner points of given feasible region are A(12, 0), B(4, 2), C(1, 5) and D(0, 10)
ub
At A(12, 0), z = 3(12) + 2(0) = 36
At B(4, 2), z = 3(4) + 2(2) = 16
At C(1, 5), z = 3(1) + 2(5) = 13
At D(0, 10), z = 3(0) + 2(10) = 20
P

Minimum value of z is 13
9. (C) The corner points of feasible region are (0, 3), (0, 5) and (3, 2)
 At (0, 3), z = 11(0) + 7(3) = 21
et

At (0, 5), z = 11(0) + 7(5) = 35

At (3, 2), z = 11(3) + 7(2) = 47
 Minimum value of z is 21
rg

 3 24  3  24  51
10. (B) At P  ,  , z = + 2  = = 3.923
 13 13  13  13  13
 3 15  3  15 
At Q  , , z = + 2  = 9
Ta

2 4  2  4
7 3 7 3
At R  ,  , z = + 2   = 5
2 4 2 4
 18 2  18 2 22
At S  , , z = + 2  = = 3.143
 7 7 7 7 7
22
 Maximum value of z is 9, and Minimum value of z is .
7
11. (B) The corner points of the feasible region are
O (0, 0), E (12, 0), H (18, 2), G (5, 15), D  0, 
35
 2
 The maximum value of 4x + 5y is at G (5, 15)
 Maximum 4x + 5y = 4 (5) + 5 (15) = 95

2
 

Chapter 7: Linear Programming

12. (C) Shaded region lies on origin side of 3x + 10y = 30
and x = 6, and on non-origin side of 4x + 5y = 20.
 4x + 5y  20, 3x + 10y  30, x  6, x, y  0
7.4 Special cases of LPP
1. (A) Assume that x and y take arbitrary large values. So the objective function can be made as large as we want.
Hence, the problem has unbounded solution.
2. (B) The feasible region is unbounded. x and y can take arbitrary large values.
Hence, the problem has unbounded solution.
3. (D) Since there are two disjoint feasible regions, the LPP has no solution.
4. (A) The feasible region is disjoint.

ns
 There is no solution.

Critical Thinking

io
7.1 Linear inequations in two variables
1. (A) 5 < x < 5  | x | < 5

at
2. (A) 3. (A)
4. (A) This line passes through origin and it represents the half Y
plane that contains the positive X-axis.
lic
ub

X X
O
P

Y

5. (B) Consider the equation, 2x  y = 1 Y

et

x y
 + =1 1 
1 / 2  1  ,0
1 2 
The line 2x  y = 1 makes intercepts of and 1 on the axes.
rg

2
Thus, the line meets X-axis at  ,0  and Y-axis at (0, 1).
1 X X
O 0
2 
(0, 1)
Consider (0, 0). Clearly (0, 0) does not satisfy the given inequation.
Ta

 The solution set of the given inequation is open half plane not
containing the origin. Y
6. (A) The inequality is 3x + 4y  12 Y
x y
 + 1
4 3
 The half plane containing the origin and the points of the
B(0, 3)
line 3x + 4y = 12 is the required solution set

X X
O A(4, 0)
3x + 4y = 12
Y
3
 

MHT-CET Triumph Maths (Solutions)

7. (C) The graph of given inequalities is common to the graphs of Y
x ≥  2, x ≤ 2, y ≥  2, y ≤ 2.

x=2
x = 2
y=2

X X
O

y=–2

ns
Y

7.2 Formulation of LPP

io
1. (D) Repersenting the given information in table form, we get
Shirt (x) Pants (y) Total availability

at
Work time on machine (hours) 2 3 70
Man labour (hours) 3 2 75
Linear constraints are 2x + 3y  70, 3x + 2y  75.
lic
Also, x  0, y  0 …[ number of shirts and pants cannot be negative]

2. (C) From the given table the constraints are 2x + 3y  36; 5x + 2y  50; 2x + 6y  60
Also, x  0, y  0 …[ number of magazines cannot be negative]
ub
 The number of constraints are 5.
3. (A) Let the factory owner purchase x units of machine A and y units of machine B for his factory.
 x0,y0 …[ number of machines cannot be negative]
P

Representing the given information in tabular form, we get

Machine A(x) Machine B(y) Total Availability
Machine Area (m2) 1000 1200 7600
et

Skilled men 12 8 72
Daily output (no. of units) 50 40 z
 1000x + 1200y  7600
rg

12x + 8y  72
4. (A) Let, x = number of necklaces, and y = number of bracelets
 x  0, y  0 …[ number of necklaces and bracelets cannot be negative]
Ta

Representing the given information in tabular form, we get

Necklace (x) Bracelet (y) Total availability
1
Time required (hrs) 1 16
2
Profit (`) 100 200 z
1
  x + y  16  x + 2y  32
2
x + y  24
Total profit z = 100x + 300y
 Required LPP is formulated as
Maximize z = 100x + 300y, subject to
x + y  24, x + 2y  32, x  0, y  0
4
 

Chapter 7: Linear Programming

5. (B) Suppose x kg of food A and y kg of food B are consumed to form a weekly diet.
 x  0, y  0. …[Since quantity of food cannot be negative]
Representing the given information in table form, we get
Food A (x) Food B (y) Minimum requirement
Fats (units) 4 12 18
Carbohydrates (units) 16 4 24
Protein (units) 8 6 16
Cost (`) 6 5 z
 Required LPP is formulated as
Minimize z = 6x + 5y subject to constraints,
4x + 12y  18, 16x + 4y  24, 8x + 6y  16, x  0, y  0

ns
6. (A) Let the consumption per day be, x grams of food X and Y grams of food Y.
 x  0 and y  0 …[ the quantities cannot be negative]
Representing the given information in table form, we get

io
Type of food Food X (x) Food Y (y) Minimum requirement
Vitamin A per gram (units) 4 6 90

at
Vitamin B per gram (units) 7 11 130
Cost per gram (paise) 15 22 z
 4x + 6y  90,
7x + 11y  130, and z = 15 x + 22 y
 Required LLP is formulated as,
lic
Minimize z = 15x + 22y , subject to constraints
4x + 6y  90, 7x + 11y  130, x  0, y  0
ub
7.3 Terminologies related to the solution of LPP, Solution of LPP by graphical method
1. (B)
2. (C) Converting the given inequalities into equations, we get x + y = 4 Y
P

The equation intersects the axes at (4 , 0) and (0 , 4) (0, 5)

The feasible region lies on origin side of lines y = 5 and x + y = 4 y=5
and in first quadrant.
(0, 4)
et

It is bounded in first quadrant.

X O (4, 0) X
rg

x+y=4
Y

3. (C) Converting given inequalities into equations, we get

Y yx=1
Ta

x y
y  x = 1 i.e.  1 …(i)
 1 1
x y
2x  6y = 3 i.e.  1 …(ii) 2x  6y = 3
3  1 
3 
2  2  A(0, 1) B , 0
2 
X (1, 0) O X
x = 0, y = 0  1 
 Equation (i) intersects the axes at (1, 0) and (0, 1)  0, 
 2
3   1  Y
Equation (ii) intersects the axes at  ,0  and  0, 
2   2 
Substituting x = 0, y = 0 in given inequalities, we get
(0)  (0) = 0  1 , and 2 (0)  6 (0) = 0  3
 Feasible region lies on the origin side of both the lines, in first quadrant.
It is unbounded and convex.
5
 

MHT-CET Triumph Maths (Solutions)

4. (D) The feasible region lies on origin side of line 2x + 3y  5 = 0 and Y
non-origin side of line 4x  3y + 2 = 0. However, it is not bounded
by any axes. 4x–3y+2= 0

X O X

2x+3y–5= 0
Y
5. (B) The feasible region lies on origin side of the lines Y  x + 3y = 9
x + 3y = 9 and x + y = 1, and in first quadrant.

ns
 It is unbounded.
(0,3)

(0,1)

io
X X
(–9,0) (– 1, 0) O

x+y=1

at
Y
6. (A) Feasible region lies on origin side of line 2x  3y = 5.
 O lies inside the region
lic Y

Substituting P (2, 2) in given inequality, we get 2x–3y=5

2 (2)  3 (2) = 10  5 X X
O 5 
ub
 P lies outside the region.  ,0 
2 
 5
 0,  
 3

Y
P

7. (C) Shaded region lies on non-origin side of 5x + 4y = 20, and on origin side of the lines x = 6 and y = 3
 5x + 4y  20, x  6, y  3, x  0, y  0
et

8. (C) The shaded region lies;

On origin side of line x + 2y = 8  x + 2y  8,
rg

On non-origin side of line 2x + y = 2  2x + y  2,

On origin side of line x  y = 1  x  y  1
and in first quadrant  x  0, y  0.
Ta

9. (B) The feasible region lies on non-origin side of line Y

2x + y = 2 and origin side of line x  y = 3 as shown in the
figure. 2x+y=2
By solving the two equations, we get the point of (0,2)
 5 4  x–y=3
intersection  ,  , which is the vertex of the common (1,0) X
3 3  X
O (3,0)
graph.
 5 4 
 , 
3 3 
(0,–3)

Y

6
 

Chapter 7: Linear Programming

10. (D) Feasible region lies on origin side of Y
line x + y = 6, non-origin side of line
3x + 2y = 6 and in the first quadrant. B(0,6)
 Vertices of the feasible region are (0, 6),
(0,3), (2, 0) and (6, 0)

D(0,3)

X X
O C(2,0) A(6,0)

ns
3x + 2y = 6 x+y=6
Y

io
11. (C) Converting the given inequalities into equations, Y
we get x = 5, x = 10, y = 5 and y = 10 (5, 10) (10, 10)
y = 10
The feasible region is as shown in the figure

at
 The vertices of the feasible region are (5, 5),
(10, 5), (10,10) and (5, 10) y=5
lic (5, 5) (10, 5)

X X
O
x=5 x = 10
Y
ub
12. (D) Converting the given inequations into equations, we get
x y Y
2x + 3y = 6 i.e.  1 …(i)
3 2
(0,5)
P

x y
5x + 3y = 15 i.e.   1 …(ii) 5x+3y=15
3 5
2x+3y=6
 Equation (i) intersects the axes at points (3, 0) and (0, 2)
et

Equation (ii), intersects at points (3, 0) and (0, 5). (0,2)

Also, substituting origin (0, 0) in both in equalities we get,
(3,0)
2(0) + 3(0) = 0  6 and 5(0) + 3(0) = 0  15 X
O
X
 Feasible region lies on origin side of both the lines as
rg

Y
shown in the graph
 The vertices of feasible region are (0, 2), (0, 0) and (3, 0)
 (0, 5) is not a vertex of feasible region.
Ta

13. (A) z = px + qy
At (25, 20), z = 25p + 20q
At (0, 30), z = 0 + 30q = 30q
Since maximum z occurs at both the points,
25p + 20q = 30q
 25p = 10q  5p = 2q

14. (C) At (10, 0), z = 60  10 + 10  0 = 600

At (2, 4), z = 60  2 + 10  4 = 160
At (1, 5), z = 60  1 + 10  5 = 110
At (0, 8), z = 60  0 + 10  8 = 80
 Maximum value of z is 600.

7
 

MHT-CET Triumph Maths (Solutions)

15. (B) The feasible region lies on the origin side of 2x + y = 30 Y
and x + 2y = 24, in the first quadrant.
The corner points of the feasible region are O (0, 0),
A (15, 0), B (0, 12) and C (12, 6) 2x+y = 30
At A(15, 0), z = 90
At B(0, 12), z = 96
B(0,12) C(12,6)
At C(12, 6), z = 120
 Maximum value of z is 120. X X
O A(15,0)
x+2y = 24
Y
16. (B) The feasible region lies on the origin side of x + y = 40 and Y
x + 2y = 60, in first quadrant.
x+y = 40

ns
The corner points of feasible region are (0,40)
O(0, 0), A(0, 30), B(20, 20) and C(40, 0)
A(0,30) B(20,20)
 At A(0, 30), P = 0 + 4 (30) = 120
At B(20, 20), P = 3(20) + 4(20) = 140 (60,0)

io
X X
At C(40, 0), P = 3(40) + 0 = 120 O C(40,0)
x+2y = 60
 Maximum value of P is 140. Y

at
17. (A) Feasible region lies on the origin side of Y
x + 5y = 200 and 2x + 3y = 134, in first
quadrant.
The corner points of the feasible region  134 
lic
are O (0, 0), A (67, 0), B (10, 38) and  0,


3 
C (0, 40) B(10, 38)
C(0, 40)
At A (67, 0), z = 268
At A (10, 38), z = 382 x + 5y =200
ub
At A (0, 40), z = 360 X X
O A(67, 0) 2x + 3y = 134 (200, 0)
 Maximum value of z is at B (10, 38)
Y
P

18. (B) Suppose that the manufacturer produces x soaps of Y

type I and y soaps of type II.
 x  0; y  0; 2x + 3y  480 and 3x + 5y  480 300
et

Feasible region lies on origin side on both 250

inequalities, in first quadrant.
The corner points of the feasible region are 200
(0, 160)
O (0, 0), A (0, 96) and B (160, 0) 150
rg

Maximum profit, P = 0.25x + 0.5y 100 A(0, 96)

 At A (0, 96), P = 0.25(0) + 0.5(96) = 48 50
At B (160, 0), P = 0.25(160) + 0.5(0) = 40 B(160, 0) (240, 0)
For maximum profit of ` 48, 96 soaps of type II X X
Ta

O 50 100 150 200 250 300

must be manufactured. 2x + 3y = 480
3x + 5y = 480
Y
19. (A) Corner points of the feasible region are (60, 0), Y
(120, 0), (60, 30), (40, 20).
At (60, 0), z = 5(60) + 10(0) = 300
At (120, 0), z = 5(120) + 10(0) = 600 x – 2y = 0
At (60, 30), z = 5(60) + 10(30) = 600
At (40, 20), z = 5(40) + 10(20) = 400 (60, 30)
(40, 20)
 Minimum value of z is 300 at (60, 0).
X
(60, 0)
X
(120, 0)
x + 2y = 120
Y x + y = 60

8
 

Chapter 7: Linear Programming

20. (A) The feasible region lies on non-origin side X2
of all the lines, in first quadrant
The corner points of feasible region are
A(11, 0), B(4, 2), C(1, 5) and D(0, 10).
 At A(11,0), z = 2(11) + 0 = 22 D(0, 10)
At B(4, 2), z = 2(4) + 3(2) = 14
At C(1, 5), z = 2(1) + 3(5) = 17
(0, 6) C(1, 5)
At D(0, 1), z = 0 + 3(10) = 30
 Minimum value of z is 14.
 22  B(4, 2)
 0, 
 7 
X1
X1 O (2, 0) (6, 0) A(11, 0)

ns
2x1+7x2= 22
X2 5x1+x2=10 x1+x2= 6
21. (A) At (5, 5), z = 3(5) + 9(5) = 60 Y
At (0, 10), z = 3(0) + 9(10) = 90

io
At (0, 20), z = 3(0) + 9(20) = 180 (0, 20)
At (15, 15), z = 3(15) + 9(15) = 180
 Minimum value of z is 60 at (5, 5).

at
(15, 15)
(0, 10)
lic (5, 5)
X 0 X

Y
ub
22. (B) The feasible region region lies on the non-origin side of Y
2x + 3y = 6 and y = 1 and on origin side of x + y = 8 x+y = 8
The corner points of feasible region are
D(0, 8)
3 
A  , 1 , B(0, 2), C(7, 1) and D(0, 8).
 
P

2
Substituting above points in z = 4x + 6y, we get
3 
Min. z = 12 at A  ,1 and B (0, 2).
2 
et

B(0, 2) A(3/2, 1) C(7, 1)

y=1
X X
O
2x + 3y = 6
rg

Y
7.4 Special cases of LPP
1. (D) The feasible region is disjoint. Y
Ta

 there is no point common to all inequations. x + y = 10

 There is no maximum value of z.

D(0,10)

B(0,6)

C(10,0)
X
X O A(9,0)

Y
2x+3y = 18

9
 

MHT-CET Triumph Maths (Solutions)

2. (C)
3. (C) The corner points of feasible region are Y
A(1, 0), B(10, 0), C (2, 4), D(0, 4) and
E (0, 1) (0, 5)
At A (1, 0), z = 1 + 0 = 1 = 1 D(0 ,4) C(2,4)
y=4
At B (10, 0), z = 10 + 0 = 10
At C (2, 4), z = 2 + 4 = 6 E(0, 1)
At D (0, 4), z = 0 + 4 = 4
X X
At E (0, 1), z = 0 + 1 = 1 O A(1, 0) B(10, 0)
z has minimum value at both A (1, 0) and
x + 2y = 10
E (0, 1). Y

ns
 z has infinite solutions on seg AE. x+y=1

4. (D) The feasible region lies on the origin side

io
of the line x + 2y = 2 and on non-origin 8
side of x + 2y = 8.
6
 There is no feasible solution.

at
x + 2y = 2 4

lic 2

2 4 6 8 10
x + 2y = 8
ub
MHT-CET Previous Years’ Questions

1. (A)
P

2. (A) Co-ordinates of the origin are (0, 0), which satisfies the given inequality.
 Given inequality lies in the origin side of x + 5y = 6.
et

3. (A) The corner points of feasible region are Y

 3 x+y = 8
A(8,0), B(0, 8), F(0, 3), G 1,  and C(4, 0)
 2 B(0,8)
rg

At F(0,3), z = 30(0) + 20(3) = 60

At G(1,3/2), z = 30(1) + 20(3/2) = 30 + 30 = 60
At A (8, 0), z = 30 (8) + 0 = 240 F(0,3)
Ta

At A (0, 8), z = 0 + 20 (8) = 160 D(0,2) G(1,3/2)

At C (4, 0), z = 30 (4) + 0 = 120 X X
O C(4,0) A(8,0)
 3
 z has minimum value at F (0, 3) and G 1, 
2   6x+4y = 12
Y
 z has infinite solution on seg FG. x+2y = 4

4. (A) 3x  8
8
i.e., x 
3
8
 Required solution set is the region towards the right side of the line x =
3

5. (C)

10
 

Chapter 7: Linear Programming

6. (A) The feasible region lies on origin side of 4x + 5y = 20, Y
non-origin side of x + y = 3 and in first quadrant.
 The corner points of feasible region are B(0,4)
A(5, 0), B(0, 4), C(3, 0) and D(0, 3)
D(0,3)
 Maximum 2x + 3y is at B (0, 4)
 Maximum 2x + 3y = 2 (0) + 4 (3) = 12
A(5,0)
X C(3,0)
X
O 4x+5y = 20
x+y=3
Y

ns
7. (B) The feasible region lies on origin side of all the Y
lines and in first quadrant. 2x+y =1
 The corner points of feasible region are

io
(0, 3)
2 7 2 7
C , 
O (0, 0), A (2, 0), B (2, 1), C  ,  and D (0, 1) 3 3
3 3
D(0,1) B(2,1)
Maximum value of z = 3x + 2y is at B (2, 1)

at
 Maximum z = 3 (2) + 2 (1) = 8 X X
O A(2,0) (3,0)

x=2 x+y = 3
lic Y
8. (A)

9. (D) Converting given inequations into equations, we get Y

ub
4x + 5y = 20, x = 6, y = 4
The feasible region is as shown in the figure.
x=6
 Given constraints form a quadrilateral.
y=4
(0, 4) (6, 4)
P

X X
et

O (5, 0) (6, 0)
4x + 5y = 20
Y
rg

10. (B) Shaded region lies on origin side of x + 2y = 8 and x  y = 1, and on non-origin side of 2x + y = 2.
 x + 2y  8, x  y  1, 2x + y  2
11. (C) Feasible region lies on origin side of
Ta

Y
x + y = 7 and x + 2y = 10, and in first
quadrant. B(0,7)
The corner points of feasible region are
O(0, 0), A(7, 0), E(4, 3) and D(0, 5) D(0,5)

 Maximum z = 5x + 2y is at A (7, 0)
E(4,3)
 Maximum, z = 5 (7) + 2 (0) = 35

X A(7,0) C(10,0)
X
O
x+y = 7 x+2y = 10
Y
11
 

MHT-CET Triumph Maths (Solutions)

12. (B) The feasible region is unbounded whose vertex is  ,  .

5 5 Y
4 4

 Minimum z = 2x + 10y is at  , 
5 5 x–y=0
4 4  
5 5 x – 5y = –5
 z = 2   + 10   = 15 5 5
4 4 (0,1)  4,4
 
X O X

Y

ns
13. (D) Feasible region lies on the origin side of 2x + y = 10
and 2x + 3y = 18, in first quadrant. Y
The corner points of the feasible region are O(0, 0), (0, 10)

io
A(5, 0), B(3, 4) and C(0, 6).
At A(5, 0), Z = 45
At B(3, 4), Z = 79

at
C(0, 6)
At C(0, 6), Z = 78
B(3, 4)
 Maximum value of Z is 79.
lic X
(9, 0)
X
O(0, 0) A(5, 0)

2x + y = 10 2x + 3y = 18
ub
Y

14. (C) Feasible region lies on the origin side of x + y = 7 and Y

P

2x + 3y = 16, in first quadrant.

The corner points of the feasible region are O(0, 0),
A(7, 0), B(5, 2) and C  0,
16 
.
et

 3 (0, 7)
At A(7, 0), Z = 21
 16 
At B(5, 2), Z = 19 C  0, 
 3
rg

At C  0,
16  32
, Z = = 10.67 B(5, 2)
 3 3
(8, 0)
 Maximum value of Z is 21. X X
O(0, 0) A(7, 0)
Ta

x+y=7 2x + 3y = 16
Y

15. (A) Let the number toys A and B sold by the dealer be x and y respectively.
 x  0, y  0 …[ number of toys cannot be negative]
 objective function is Maximize z = 10x + 15y.
Also, constraints are x + y  40, 75x + 90y  580

16. (B) Take a test point (2, 1) which lies within the feasible region.
Since 2 – 1 = 1  0, 2  5, 1  3 and 2,1  0
 x, y  0, x  y  0, x  5, y  3.

12
 

Chapter 7: Linear Programming

17. (C) The corner points of feasible region are Y
A (6, 0), B (6, 4), C (3, 7) and D (0, 5)
 At A (6, 0), z = 6 + 0 = 6 C (3, 7)
At B (6, 4), z = 6 + 4 = 10
At C (3, 7), z = 3 + 7 = 10
D (0, 5)
B (6, 4)
2x + 3y = 15

X
O A (6, 0)
x + y = 10
x=6
18. (C)

ns
X2
19. (A) The corner points of the feasible region are
A(3.5, 0), B(7.5, 0), C(3, 3) and D(2, 3)
(0, 7)
At A(3.5, 0), z = 4(3.5) + 5(0) = 14

io
At B(7.5, 0), z = 4(7.5) + 5(0) = 30
At C(3, 3), z = 4(3) + 5(3) = 27
At D(2, 3), z = 4(2) + 5(3) = 23 (0, 5)
 z is minimum at A(3.5, 0).

at
C(3, 3) x2 = 3
D(2, 3)
lic A(3.5, 0) B(7.5, 0)
X1
2x1+ 3x2 = 15
2x1 + x2 = 7
ub
20. (A) Corner points of the feasible region are Y
9 5  26 
(0, 0) (6, 0),  ,  and  0 ,  10
2 2  5  3x + 5y = 26
8
At (0, 0), z = 2(0) + 0 = 0
P

At (6, 0), z = 2(6) + 0 = 12 6

 26 
9 5 9 5  0, 
At  ,  , z  2    = 11.5  5  4
2 2  2 2 9 5
 , 
et

 26  26 2 2
At  0 ,  , z = 2(0) + = 5.2 2
 5  5
(6, 0)
 Maximum value of z is 12 at (6, 0). X X
rg

O 2 4 6 8 10

Y
21. (D) The corner points of the feasible region are 5x + 3y = 30
Y
Ta

A(4, 2), B (4, 6) and C (0, 6).

At A (4, 2), z = 10
At B (4, 6), z = 14 C (0, 6) B (4, 6)
At C (0, 6), z = 6 y=6
 Maximum value of z is 14.

A (4, 2)
X
(6, 0)

x=4 x+y=6
13
 

MHT-CET Triumph Maths (Solutions)

Y
22. (B) The corner points of the feasible region are
A(4, 0), B (18, 0), C (3.6, 8), D(0, 8) and E(0, 4).
At A (4, 0), z = 24
At B (18, 0), z = 108
At C (3.6, 8), z = 37.6 D (0, 8) C(3.6, 8) y=8
At D (0, 8), z = 16
At E (0, 4), z = 8
5x + 9y = 90
 Minimum value of z occurs at (0, 4).
E (0, 4)

ns
A (4, 0) B (18, 0)

io
x+y=4
23. (B) Feasible region lies on the origin side of lines x = 3 Y
and y = 3, on the non-origin side of x + y = 5, in

at
first quadrant. The corner points of the feasible
region are A(3, 2), B(3, 3), C(2, 3). (0, 5)
At A(3, 2), Z = 80
At B(3, 3), Z = 105
At C(2, 3), Z = 95
lic C(2, 3)
B(3, 3)
y=3
 Minimum value of Z is 80. A(3, 2)

(5, 0)
ub
X X
O(0, 0) (3, 0)
x+y=5
Y x=3

Y
P

24. (C) Feasible region lies of the origin side of 3x + 2y = 12

and 2x + 3y = 12, in first quadrant.
The corner points of the feasible region are O(0, 0),
A(4, 0), B 
12 12  (0, 6)
et

,  and C(0, 4).

5 5
At A(4, 0), Z = 36 C(0, 4)  12 12 
B , 
At B  ,  , Z = 48 5 5
12 12
rg

 5 5
(6, 0)
At C(0, 4), Z = 44 X X
O(0, 0) A(4, 0)
 Maximum value of Z is 48.
2x + 3y = 12
Ta

3x + 2y = 12
Y
25. (B) Feasible region lies on the origin side of x1 – x2 = 3, Y
non-origin side of 3x1 + 2x2 = 9, in first quadrant.
 Feasible region is unbounded. x1 – x2 = 3
 L.P.P. has unbounded solution.

B(0, 4.5)

A(3, 0)
X X
O(0, 0)

3x1 + 2x2 = 9
Y
14
 

Chapter 7: Linear Programming

26. (A) Feasible region lies on the origin side of x = 2 and y = 2, Y
non-origin side of x + y = 3, in first quadrant.
The corner points of the feasible region are A(2, 1),
B(2, 2) and (1, 2).
Given that, Z = ax + by has minimum value at (2, 1) only.
 Z at (2, 1) < Z at (1, 2)
C(1, 2)
 2a + b < a + 2b y=2
 a<b B(2, 2)
A(2, 1)
X X
O(0, 0)
x=2 x+y=3

ns
Y

27. (C) Feasible region is unbounded. Y

io
The corner points of the feasible region are A(2, 1) and 2x – y = 0
B(1, 2)
 Z at A(2, 1) = 14
Z at B(1, 2) = 13 x – 2y = 0

at
 Minimum value of Z is 13.
B(1, 2)
lic A(2, 1)
X X
O(0, 0)
x+y=3
Y
ub
28. (A) Feasible region lies on the origin side of x + y = 1 and Y
non-origin side of 2x + 2y = 6
 The given feasible region on has no solution.
P
et

X X
O(0, 0)
2x + 2y = 6
rg

x+y=1
Y

29. (D)
Ta

30. (D) Feasible region lies on the origin side of 8x + 5y = 60 and Y

4x + 5y = 40, in first quadrant.
 Feasible region is a quadrilateral.

C(0, 8)

X X
O(0, 0) A(7.5, 0)
4x + 5y = 40
8x + 5y = 60
Y

15
 

MHT-CET Triumph Maths (Solutions)

31. (B) The corner points of the feasible region are A(0, 15),
B(15, 0), C(15, 15), D(10, 20) and E(0, 20). Y
 Z at A(0, 15) = 15 x = 15
Z at B(15, 0) = 15
Z at C(15, 15) = 30 D(10, 20)
E(0, 20) y = 20
Z at D(10, 20) = 30
Z at E(0, 20) = 20 C(15, 15)
A(0, 15)
 Z has minimum value at every point on seg AB.
 Given L.P.P. has infinite solutions.

B(15, 0)
X X

ns
O(0, 0)
x + y = 30
Y x + y = 15

io
32. (C) Shaded region lies on the origin side of –7x + 14y = 14, 3x + 4y = 18 and x – 6y = 3
 –7x + 14y  14, 3x + 4y  18 and x – 6y  3

at
And also the shaded region lies on the non-origin side of 2x + 3y = 3
 2x + 3y  3.
 Option (C) is correct. lic
33. (A) The corner points of the feasible region are A(3.5, 0), Y
B(7.5, 0), C(3, 3) and D(2, 3)
ub
 Z at A(3.5, 0) = 14
Z at B(7.5, 0) = 30
Z at C(3, 3) = 27 (0, 7)
Z at D(2, 3) = 23 (0, 5) D(2, 3)
P

 Minimum value of Z is 27, that lies on line 2x + 3y = 15 C(3, 3) y=3

B(7.5, 0)
X X
et

O(0, 0) A(3.5, 0)
2x + 3y = 15
2x + y = 7
Y
rg

34. (A) Feasible region lies on the non-origin side of x = 2 and

x + y = 5, origin side of y = 4, in first quadrant. Y
Ta

 The common region is unbounded and non-origin side.

y=4

X X
O(0, 0)
x=2 x+y=5
Y

16
 

Chapter 7: Linear Programming

35. (B) Feasible region lies on the origin side of 2x – y = 6, Y
non-origin side of x + 2y = 4, in first quadrant.
 The common region is unbounded and non-origin side.
2x – y = 6

X X
O(0, 0)
x + 2y = 4
Y

ns
36. (B) The corner points of the feasible region are A(4, 0), Y
B(3, 2), C(0, 4) and O(0, 0).
Z at A(4, 0) = 16
Z at B(3, 2) = 22 (0, 8)
Z at C(0, 4) = 20

io
 Maximum value of Z is 22.
C(0, 4)
B(3, 2)

at
X X
O(0, 0) A(4, 0)
2x + 3y = 12
lic Y
2x + y = 8

37. (B) Note that point (1, 2) satisfies all the given inequalities.
 Option (B) is correct.
ub
38. (A) Feasible region lies on the origin side of 2x + 3y = 18 Y
and non-origin side of x + y = 10.
 Feasible region is an empty set.

(0, 10)
P

(0, 6)
et

(9, 0) (10, 0)
X X
O(0, 0) 2x + 3y = 18
x + y = 10
rg

Y
39. (D) The corner points of the feasible region are (5, 0), (6, 0), (1.5, 6), (0, 7) and (0, 5)
 Z at (5, 0) = 10,
Ta

Z at (6, 0) = 12,
Z at (1.5, 6) = 9,
Z at (0, 7) = 7
Z at (0, 5) = 5
 Maximum value of Z is 12 and occurs at (6, 0).
40. (D) Feasible region lies on origin side of x – 2y = 2, 4x + 5y = 20 Y
and on non-origin side of 5x + 2y = 10, in 1st quadrant. 5
4x + 5y = 20
4
3
2 x – 2y = 2
1
0 1 2 3 4 5
X
–1
5x + 2y = 0

17
 

MHT-CET Triumph Maths (Solutions)

41. (A) Let the corner points of the feasible region be A, B, C, D. Y
Solving equations y = 3 and 2x + 3y = 12, we get x=4
A = (1.5, 3) 6 y=x+3
Similarly,
C
B = (4, 3), C = (4, 7), D =  , 
3 18
5 5  4 D
Let Z = 3x + 5y y=3
A B
 Value of Z at point A = 19.5
Value of Z at point B = 27 2
Value of Z at point C = 47
99
Value of Z at point D = X

ns
5 0 2 4 6
2x + 3y = 12
 The minimum value of Z is 19.5.

io
42. (B) Objective function z = 3x + 5y Y
The corner points of the feasible region are O(0, 0), x=4

at
A(4, 0), B(4, 3), C(2, 6) and D(0, 6)
(0, 9)
 Z at A(4, 0) = 12
Z at B(4, 3) = 27 C(2, 6)
Z at C(2, 6) = 36
lic D(0, 6)
y=6

Z at D(0, 6) = 30
 Maximum value of Z is 36. B(4, 3)
ub

(6, 0)
X X
O(0, 0) A(4, 0)
Y
P

3x + 2y = 18
et

43. (C) Corner points of the given feasible region are O(0, 0), C(10, 10), D(10, 20), B(0, 25)
 z at C(10, 10) = 70,
z at D(10, 20) = 110,
rg

z at B(0, 25) = 100

 The maximum value of z is 110.

44. (B) Feasible region lies on the origin side of lines x + y = 20,
Ta

Y
x = 10 and on non-origin side of y = 5.
 Corner points of the feasible region are A(0, 5), B(10, 5),
C(10, 10) and D(0, 20)
z at A(0, 5) = 40 D(0, 20)
z at B(10, 5) = 110
C(10, 10)
z at C(10, 10) = 150
z at D(0, 20) = 160 y=5
A(0, 5) B(10, 5)
 Maximum value of z is 160. X X
x + y = 20
Y x = 10
45. (B)
Shaded region lies on origin side of 4x + 7y = 28 and above the line y = 1, and on non-origin side of 3x + 4y = 12.
 3x + 4y  12, 4x + 7y ≤ 28, y  1, x  0, y  0

18
 

Chapter 7: Linear Programming

46. (C) At (0, 0), z = 10(0) + 25(0) = 0
At (3, 0), z = 10(3) + 25(0) = 30
At (3, 2), z = 10(3) + 25(2) = 80
At (2, 3), z = 10(2) + 25(3) = 95
At (0, 3), z = 10(0) + 25(3) = 75
 Maximum value of z is 95.
47. (A) Take a test point (4, 10) that lies within the S2 region.
Since 4(4) + 3(10) = 46 ≤ 60, 10  2(4) = 8, 4  3, 4  0, 10  0
 The solution set is represented by S2 region.
48. (D) Shaded region lies on origin side of 3x + 6y = 18, x – 3y = 3, –x + 2y = 2 and on non-origin side of
2x + 3y = 6.
 2x + 3y  6, 3x + 6y ≤ 18, x – 3y ≤ 3, –x + 2y ≤ 2, x  0, y  0

ns
Evaluation Test

io
1. (A) Let the company produce x telephones of A type and Y
y telephones of B type.

at
 Objective function is maximize z = 300x + 400y
 Constraints are 2x + 4y  800  x + 2y  400, x + y  300
(0, 300)
Maximize z = 300x + 400y
lic
 The feasible region of the LPP is bounded. (0, 200)
x + 2y = 400
(400, 0)
X X
O (300,0)
ub
x + y = 300

Y
2. (D) For (1, 3), 3x + 2y = 3 + 6 > 0,
P

for (5, 0), 3  5 + 0 > 0,

and for (1, 2), 3 + 4 > 0
et

Similarly, other inequalities satisfy the given points.

 Option (D) is the correct answer.

3. (B) The feasible region lies on origin side of the lines X2

rg

x1 + x2 = 1 and x1 + 3x2 = 9, in first quadrant.

It is unbounded. x1 + x2 = 1
x1 + 3x2 = 9
Ta

(0,3)

(–9,0) (0,1)
X1
(–1,0) O

4. (C) Consider option (C)

3 + 2(4)  11
3(3) + 4(4) ≤ 30
2(3) + 5(4) ≤ 30
 All the above three in-equalities hold for point (3, 4).
 Option (C) is the correct answer.

19
 

MHT-CET Triumph Maths (Solutions)

5. (D) OABCD is the feasible region Y
 O(0, 0), A(0, 600), B(800, 600),
C(1000, 500), D(1500, 0)
(0,1500)
z = x 1 + x2
At point C and D, z is maximum.
Max z = 1500
 Infinite optimal solutions exist (0,1000)
along CD.
B(800,600) x2 = 600
A(0,600) C(1000,500)

ns
(2000,0)
X X
O D(1500,0)
x1 + 2x2 = 2000
Y x1 + x2 = 1500

io
6. (B)
7. (C) Given that 4x + 2y  8, 2x + 5y  10

at
 The feasible region lies on origin side of 4x + 2y = 8 and 2x + 5y = 10.
Also, x, y  0
 The feasible region lies in first quadrant.
 option (C) is correct.
lic
8. (C) Since shaded region lies on origin side of lines x + y = 20 and 2x + 5y = 80 and is in first quadrant
 x + y  20 , 2x + 5y  8, x  0, y  0
ub
9. (C) Objective function z = x1 + x2 X2
The corner points of feasible region are
2 7
O(0, 0), A(2, 0), B(2, 1), C  ,  and D(0, 1)
 
3 3
2 7
P

2 7 C , 
At B(2, 1) and C  ,  , z is maximum. Max z = 3 
3 3 
3 3
 Infinite number of solutions exists along BC. B(2, 1)
D(0,1)
et

X1 X1
O A(2,0)
2x1 + x2 = 1 x1 + x2 = 3
rg

X2 x1 = 2

10. (C) Let the manufacturer produce x and y bottles of medicines A and B.
3x y
 66, x + y  45000, x  20000, y  40,000, x  0, y  0.
Ta

He must have +
1000 1000
 The number of constraints is 6.
11. (B) Objective function P = 2x + 3y Y
The corner points of feasible region are
(0,30) x = 20
B(12, 12), C(3,3), D(20, 3), E(20, 10), F(18, 12)
At B, PB = 2 (12) + 3 (12) = 60 xy=0
At C, PC = 2 (3) + 3 (3) = 15
At D, PD = 2 (20) + 3 (3) = 49
B(12,12) F(18,12)
At E, PE = 2 (20) + 3 (10) = 70 y = 12
At F, PF = 2 (18) + 3 (12) = 72 E(20,10)
 P is maximum at F(18, 12). C(3,3) D(20,3) y=3
X O X
(30, 0) x + y = 30

Y
20
 

Chapter 7: Linear Programming

12. (D) The feasible region is unbounded. Y
 Maximum value does not exist.
(0, 100)
3x+2y = 160

(20, 50)
(0, 40)
(40, 20)
(80,0)
X X
x+2y=80

ns
Y 5x+2y = 200
13. (D) Objective function z = 3x + 2y Y
The corner points of feasible region are y  5x = 0
1 5 1 5 5 7 (0,6) x=3

io
A  ,  , B  ,  , C(1, 0), D(3, 0), E(3, 3), F  , 
4 4 6 6 2 2
1 5
At A = zA = 3   2   = 3.25 F(5/2, 7/2)
4   
4

at
E(3,3)
1 5
At B = zB = 3   2   = 2.167
6 6
A(1/4, 5/4)
At C = zC = 3(1) + 2(0) = 3
At D = zD = 3(3) + 2(0) = 9
lic X
B(1/6,5/6)
D(3,0) (6,0)
X
At E = zE = 3(3) + 2(3) = 15 O C(1,0)
x  y = 1 x+y=6
5 7 x+y=1
At F = zF = 3   2   = 14.5
 
2  
2
ub
Y
 Maximum value of z at (3,3) is 15.
14. (D) Let no. of model M1 = x and no. of model M2 = y Y
 x ≥ 0, y ≥ 0
Constraints are 4x + 2y ≤ 80  2x + y ≤ 40, 2x + 5y ≤ 180
P

(0, 40)
Maximize z = 3x + 4y
The corner points of feasible region are O(0, 0), A(20, 0), C(0, 36)
B(2.5, 35), C(0, 36) B(2.5, 35)
et

 At A (20, 0), z = 3(20) + 0 = 60 2x + 5y = 180

At B (2.5,35), z = 3(2.5) + 4(35) = 147.5 (90,0)
At C (0, 36), z = 0 + 4(36) = 144 X X
O A(20, 0)
 z is maximum at B(2.5, 35).
rg

2x+y=40
Y
Ta

21