Module 8

Linear Inequalities and LPP

Key points

ADHYAYANA ACADEMY Page 1

KCET – Mathematics – 2022

Prepared By : Linge Gowda A P (99160 23722) Page 2

 Linear Inequalities and LPP

ADHYAYANA ACADEMY Page 3

KCET – Mathematics – 2022

Prepared By : Linge Gowda A P (99160 23722) Page 4

 Linear Inequalities and LPP

ADHYAYANA ACADEMY Page 5

KCET – Mathematics – 2022

Linear Inequalities:

1 1
1. ab   .
a b
2. x  a  − a  x  a or x   −a, a  for a  0 .

3. x  a  − a  x  a or x  ( −a, a ) for a  0 .

4. x  a  ( x  −a or x  a ) or x  ( −, −a    a,  ) for a  0 .

5. x  a  ( x  −a or x  a ) or x  ( −, −a )  ( a,  ) for a  0 .

6. x − a  b  a − b  x  a + b , a  R and b  0 .

7. ( x − a )( x − b )  0  a  x  b , for a  b .

8. ( x − a )( x − b )  0  x  a or x  b , for a  b .

x−a
9.  0  a  x  b , for a  b .
x −b
x−a
10.  0  x  −a or x  b , for a  b .
x −b

Linear Programming Problem :

1. In a linear programming problem, Z = ax + by (where a and b are constants) the linear

function of the variables x and y which is to be optimized (maximized or minimized) is called

objective function.
2. Decision variables are the variables which represents quantities to be determined and they
are usually denoted by x and y.
3. The limitations on resources which are to be allocated among various competing variables
are in the form of linear equations or in equations (inequalities) and are called constraints
(restrictions).
4. All decision variables must assume non-negative values, as negative values of physical
quantities are impossible situations.
5. A problem which seeks to maximize or minimize a linear function subjected to constraints
as determined by a set of linear inequalities is called an Optimization problem.
6. The common region determined by all the constraints including non-negative constraints of
a LPP is called the feasible region (solution region).
7. The feasible region consisting of infinitely many points which satisfies all the constraints is
called feasible solutions.
8. Each point in the feasible region is called feasible choice.

Prepared By : Linge Gowda A P (99160 23722) Page 6

 Linear Inequalities and LPP

9. Any point outside the feasible region is called infeasible solution.

10. Any point in the feasible region that gives the optimal value (maximum or minimum) of the
objective function is called optimal solution.
11. A feasible region of the system of linear inequalities is said to be bounded then the objective
function Z has both maximum and a minimum value.
12. A feasible region of the system of linear inequalities is said to be unbounded then the
objective function Z has either a maximum or a minimum or no value.
13. A convex polygon is a simple polygon (not self-intersecting) in which no line segment
between two points on the boundary ever goes outside the polygon.

Class work

1. Given that x , y and b are real numbers and x  y, b  0, then

x y x y x y x y
(a)  (b)  (c)  (d) 
b b b b b b b b

2. If −3 x + 17  −13, then
(a) x  (10, ) (b) x  [10, ) (c) x  (−,10) (d) x  [−10,10)

3. If x is a real number and x  3 , then

(a) x  3 (b) −3  x  3 (c) x  −3 (d) −3  x  3

4. x and b are real numbers. If b  0 and | x |  b, then

(a) x  (−b, ) (b) x  (−, b) (c) x  (−b, b) (d) x  (−, − b)  (b, )

ADHYAYANA ACADEMY Page 7

KCET – Mathematics – 2022

5. The inequality representing the following graph is:

(a) | x |  5 (b) | x |  5 (c) | x |  5 (d) | x |  5

6. The set A =  x : 2 x + 3  7 is equal to the set [KCET 2014]

(a) B =  x : −3  x  7 (b) C =  x : −13  2 x  4

(c) D =  x : 0  x + 5  7 (d) E =  x : −7  x  7

x2 + 6 x − 7
7. The solution set of the in equation  0 is [KCET 2015]
x+4

(a) ( −7,1) (b) ( −7, −4) (c) ( −7, −4)  ( −4,1) (d) ( −7, −4)  ( 4,1)

Prepared By : Linge Gowda A P (99160 23722) Page 8

 Linear Inequalities and LPP

8. If x − 2  1 , then [KCET 2017]

(a) x  1,3 (b) x  (1,3) (c) x   −1,3) (d) x  ( −1,3)

9. If x + 5  10 , then [KCET 2018]

(a) x  ( −15,5 (b) x  ( −5,5 (c) x  ( −, −15  5,  ) (d) x   −, −15  5,  )

10. If 3x − 5  2 , then [KCET 2019]

9 7 9 7
(a) 1  x  (b) −1  x  (c) −1  x  (d) 1  x 
3 3 3 3

x−2
11. If  0 , then
x−2
(a) x   2,  ) (b) x  ( 2,  ) (c) x  ( −, 2 ) (d) x  ( −, 2

ADHYAYANA ACADEMY Page 9

KCET – Mathematics – 2022

12. The length of a rectangle is three times the breadth. If the minimum perimeter of the
rectangle is 160cm, then
(a) breadth > 20cm (b) length < 20cm (c) length  20cm (d) breadth  20cm

13. If x + 3  10 , then

(a) x  ( −13,7 (b) x  ( −13,7 )

(c) x  ( −, −13   7,  ) (d) x   −, −13  7,  )

x−2
14. If  2 , then
x+5
(a) x   −12, −5 (b) x  ( −12, −5) (c) x  ( −5, 2 ) (d) x  ( −2,5)

x 1
15. If  , then
2x +1 4
 1 1   1 1 
(a) x   −, −    ,   (b) x   −, −    ,  
 2 2   2 2 
 1 1  1 1
(c) x   − ,  (d) x   − , 
 2 2  2 2

16. A LPP means

(a) only objective function is linear
(b) only constraints are linear
(c) either objective function or constraints are linear
(d) all objective function and constraints are linear

Prepared By : Linge Gowda A P (99160 23722) Page 10

 Linear Inequalities and LPP

17. In a LPP, the linear function which has to be maximized or minimized is called
(a) constraint (b) linear objective function
(c) optimal function (d) non negativity restrictions

18. In a LPP, the linear inequalities or restrictions on the variables are called
(a) constraints (b) objective functions
(c) non negativity restrictions (d) none of these

19. The common region determined by all the linear constraints of a LPP is called
(a) constraint region (b) optimal region
(c) feasible region (d) objective region

20. If the feasible region for a LPP is bounded, then the objective function Z = ax + by has
(a) only maximum value (b) only minimum value
(c) no value (d) both maximum and minimum value

21. In a LPP, the objective function is always

(a) quadratic (b) linear (c) in equation (d) all of the above

22. If the optimal value of the objective function Z = ax + by may or may not exist, then the
feasible region for a LPP is
(a) no feasible region (b) un bounded (c) bounded (d) none

23. The feasible region for an LPP is always a

(a) concave polygon (b) convex polygon (c) bounded (d) unbounded

ADHYAYANA ACADEMY Page 11

KCET – Mathematics – 2022

24. If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
[KCET 2017]
(a) the required optimal solution is at the midpoint of the line joining two points
(b) the optimal solution occurs at every point on the line joining two points
(c) the LPP under consideration is not solvable
(d) the LPP under consideration must be reconstructed

25. The objective function of LPP defined over the convex set attains its optimum value at
(a) at least two of the corner points (b) all the corner points
(c) at least one of the corner points (d) none of the corner points

26. Which of the terms is not used in a linear programming problem ?

(a) Optimal solution (b) Feasible solution
(c) Concave region (d) Objective function

27. The optimal value of the objective function is attained at the points
(a) on x – axis (b) which are corner points of the feasible region
(c) on y – axis (d) none of the above

Prepared By : Linge Gowda A P (99160 23722) Page 12

 Linear Inequalities and LPP

28. The minimum value of the objective function Z = ax + by in a LPP always occur at
(a) only one point (b) exactly at two points
(c) one or more points (d) none

29. The feasible region of LPP is a convex polygon and its two consecutive vertices gives
optimum solution the LPP has
(a) only one and finite solution (b) no solution
(c) two solutions (d) None of the above

30. 3x  8 has solution in

(a) Ist and IInd quadrant (b) IIIrd and IVth quadrant
(c) IInd and IIIrd quadrant (d) Ist and IVth quadrant

ADHYAYANA ACADEMY Page 13

KCET – Mathematics – 2022

31. The corner points of the feasible region determined by the following system of linear

inequalities: 2 x + y  10 , x + 3 y  15 , x, y  0 are ( 0, 0 ) , ( 5,0 ) , ( 3, 4 ) and ( 0,5) . Let Z = px + qy

, where p, q  0 . Condition on p and q so that the maximum of Z occur at both ( 3, 4 ) and

( 0,5) is

(a) p = q (b) p = 2q (c) p = 3q (d) q = 3 p

32. Corner points of the feasible region determined by the system of linear constraints are ( 0,3) ,

(1,1) and ( 3,0 ) . Let Z = px + qy , where p, q  0 . Condition on p and q so that the minimum

of Z occur at ( 0,3) and (1,1) is [KCET 2020]

q
(a) p = 2q (b) p = (c) p = 3q (d) p = q
2

Prepared By : Linge Gowda A P (99160 23722) Page 14

 Linear Inequalities and LPP

33. The corner points of the feasible region determined by the system of linear constraints are

( 0, 0 ) , ( 0, 40 ) , ( 20, 40 ) , ( 60, 20 ) , ( 60, 0 ) . The objective function is Z = 4 x + 3 y . Compare the

quantity in column A and column B.

Column A Column B
Maximum of Z 325
(a) the quantity in the column A is greater
(b) the quantity in the column B is greater
(c) the two quantities are equal
(d) the relationship cannot be determined on the basis of the information supplied

34. If x + y  2 , x  0 , y  0 the point at which maximum value of 3x + 2 y attained will be

[KCET 2014]

1 1
(a) ( 0, 0 ) (b)  ,  (c) ( 0, 2 ) (d) ( 2, 0 )
2 2

35. Corner points of the feasible region for an LPP are ( 0, 2 ) , ( 3,0 ) , ( 6, 0 ) , ( 6,8) and ( 0,5) . Let

F = 4 x + 6 y be the objective function. The minimum value of F occurs at

(a) ( 0, 2 ) only

(b) ( 3,0) only

(c) the midpoint of the line segment joining the points ( 0, 2 ) and ( 3,0 ) only

(d) any point on the line segment joining the points ( 0, 2 ) and ( 3,0 )

36. The shaded region is the solution set of the inequalities : [KCET 2021]

ADHYAYANA ACADEMY Page 15

KCET – Mathematics – 2022

(a) 5 x + 4 y  20, x  6, y  3, x  0, y  0 (b) 5 x + 4 y  20, x  6, y  3, x  0, y  0

(c) 5 x + 4 y  20, x  6, y  3, x  0, y  0 (d) 5 x + 4 y  20, x  6, y  3, x  0, y  0

37. The feasible region for a LPP is shown in the figure. Evaluate Z = 4 x + y at each of the
corner point of this region, then the minimum value of Z ( if it exist ) is
(a) 3
(b) 17
(c) 9
(d) does not exist

38. For the LPP; maximize z = x + 4 y subject to the constraints x + 2 y  2 , x + 2 y  8 , x, y  0

[KCET 2018]
(a) zmax = 4 (b) zmax = 8 (c) zmax = 16 (d) has no feasible solution

39. The feasible region for a LPP is shown in the figure, then the maximum and minimum
values of Z = 11x + 7 y are respectively
(a) 21 and 47
(b) 47 and 21
(c) 47 and 35
(d) 35 and 21

40. The shaded region in the figure is the solution set of the inequalities. [KCET 2019]

Prepared By : Linge Gowda A P (99160 23722) Page 16

 Linear Inequalities and LPP

(a) 4 x + 5 y  20, 3x + 10 y  30, x  6, x, y  0

(b) 4 x + 5 y  20, 3x + 10 y  30, x  6, x, y  0
(c) 4 x + 5 y  20, 3x + 10 y  30, x  6, x, y  0
(d) 4 x + 5 y  20, 3x + 10 y  30, x  6, x, y  0

41. The shaded region in the figure is the solution set

of the in equations [KCET 2017]
(a) 5 x + 4 y  20, x  6, y  3, x  0, y  0
(b) 5 x + 4 y  20, x  6, y  3, x  0, y  0
(c) 5 x + 4 y  20, x  6, y  3, x  0, y  0
(d) 5 x + 4 y  20, x  6, y  3, x  0, y  0
42. The feasible region of an LPP is shown in the figure. If z = 3x + 9 y , then the minimum value
of z occurs at [KCET 2018]

(a) ( 5,5)
(b) ( 0,10)
(c) ( 0, 20 )
(d) (15,15)

43. The shaded region shown in figure is given by the in-equation [KCET 2015]
(a) 14 x + 5 y  70, y  14 and x − y  5
(b) 14 x + 5 y  70, y  14 and x − y  5
(c) 14 x + 5 y  70, y  14 and x − y  5
(d) 14 x + 5 y  70, y  14 and x − y  5
44. The feasible region of an LPP is shown in the figure. If
Z = 11x + 7 y then the maximum value of Z occurs at
[KCET 2020]
(a) (0,5)
(b) (3,3)
(c) (5,0)
(d) (3,2)

45. z = 3x + 2 y subjected to x + y  8 , 3x + 5 y  15 , x  0 , y  0 has

(a) maximum (b) minimum
(c) both maximum and minimum (d) no feasible region

ADHYAYANA ACADEMY Page 17

KCET – Mathematics – 2022

Assignment

46. If x  5, then
(a) − x  −5 (b) − x  −5 (c) − x  −5 (d) − x  −5
47. If | x − 1|  5, then

(a) x  ( − 4, 6 ) (b) x  [ − 4, 6 ] (c) x  ( − , − 4)  ( 6,  ) (d) x  [ − , − 4 )  (6,  )

48. If | x + 2|  9, then

(a) x  ( − 7,11) (b) x  [ − 11,7 ] (c) x  ( −  − 7 )  (11,  ] (d) x  ( − , −7,]  (11,  ]

Solution of a linear inequality in variable x is represented on number line in Exercises 04 to 07.
Choose the correct answer from the given four options in each of the exercises.
49. (a) x  ( − , 5 ) (b) x  ( − , 5 ]

(c) x  [5,  ] (d) x  (5,  )

9 9
50. (a) x  ( ,  ) (b) x  [ ,  )
2 2
9 9
(d) x  [ − , ) (d) x  ( − , ]
2 2
7 7
51. (a) x  ( − , ) (b) x  ( − , ]
2 2
7 7
(c) x  [ , −  ) (d) x  ( ,  )
2 2
52. (a) x  ( − , − 2) (b) x  ( − , − 2]

(c) x  ( − 2,  ] (d) x  [ − 2,  )
53. The corner points of the feasible region determined by the system of linear constraints are

( 0,10) , ( 5,5) , (15,15) , ( 0, 20 ) . Let Z = px + qy , where p, q  0 . Condition on p and q so that

the maximum of Z occur at both (15,15) and ( 0, 20 ) is

(a) p = q (b) p = 2q (c) q = 2 p (d) q = 3 p

54. The feasible region for a LPP is shown in the figure. Let Z = 3x − 4 y be the objective function.
Minimum of Z occurs at

(a) ( 0, 0 )
(b) ( 0,8)
(c) ( 5,0)

Prepared By : Linge Gowda A P (99160 23722) Page 18

 Linear Inequalities and LPP

(d) ( 4,10)
55. Refer to question no. 54 Maximum of Z occurs at

(a) ( 5,0) (b) ( 6,5) (c) ( 6,8) (d) ( 4,10)

56. Refer to question no. 54 ( Maximum value of Z + Minimum value of Z ) is equal to
(a) 13 (b) 1 (c) -13 (d) -17
57. Feasible region (shaded) for LPP is shown in the figure. Minimum of Z = 4 x + 3 y occur at the
point

(a) ( 0,8)
(b) ( 2,5)
(c) ( 4,3)
(d) ( 9, 0 )
58. The maximum value of 2x + y subject to 3x + 5 y  26 and 5 x + 3 y  30 , x  0 , y  0 is
(a) 12 (b) 11.5 (c) 10 (d) 17.33
59. The objective function z = 4 x + 5 y , subject to 2 x + y  7 , 2 x + 3 y  15 , y  3 , x, y  0 has
minimum value at the point
(a) on x – axis (b) on y – axis
(c) at the origin (d) on the line parallel to x - axis
60. The shaded part of given figure indicates in feasible region, then the constraints are
(a) x, y  0, x + y  0, x  5, y  3

(b) x, y  0, x − y  0, x  5, y  3

(c) x, y  0, x − y  0, x  5, y  3

(d) x, y  0, x − y  0, x  5, y  3

61. The constraints − x + y  1, − x + 3 y  9, x, y  0 defines on

(a) bounded feasible region (b) both bounded and unbounded feasible space
(c) unbounded feasible region (d) none of the above
62. The maximum value of the objective function z = 3x + 2 y for linear constraints x + y  7,

2 x + 3 y  16 , x  0, y  0 is
(a) 16 (b) 21 (c) 25 (d) 28
63. The maximum value of z = 9 x + 13 y subject to 2 x + 3 y  18, 2 x + y  10, x  0, y  0 is
(a) 130 (b) 81 (c) 79 (d) 99
64. A wholesale merchant wants to start the business of cereal with 24000. Wheat is ₹ 400 per
quintal and rice is ₹ 600 per quintal. He has capacity to store 200 quintal cereal. He earns

ADHYAYANA ACADEMY Page 19

KCET – Mathematics – 2022

the profit ₹ 25 per quintal on wheat and ₹ 40 per quintal on rice. If he stores x quintal rice
and y quintal wheat, then for maximum profit the objective function is
400 600
(a) 25 x + 40 y (b) 40 x + 25 y (c) 400 x + 600 y (d) x+ y
40 25
65. For the LPP Min z = x + y such that inequalities 5 x + 10 y  0 , x + y  1 , y  4 and x, y  0
(a) There is a bounded solution (b) There is no solution
(c) There are infinite solution (d) None of the above
66. If the given constraint are 5 x + 4 y  2 , x  6 , y  7 , then the maximum value of the function

z = x + 2 y is
(a) 13 (b) 14 (c) 15 (d) 20
67. z = 30 x + 20 y , x + y  8 , x + 2 y  4 , 6 x + 4 y  12 , x, y  0 has
(a) unique solution (b) infinitely many solutions

(c) minimum at ( 4, 0 ) (d) minimum 60 at ( 0,3)

68. The minimum value of the function z = 2 x − y subjected to the constraints x + y  5 ,

x + 2 y  8 , x  0 , y  0 is
(a) z = 5 (b) z = 1 (c) z = −4 (d) z = −5
69. Minimize z = x + 3 y subjected to the constraints x + y  10 , 2 x − y  0 , x, y  0 . In the above
linear programming problem, the objective function is
(a) z = x + 2 y (b) z = x − 2 y (c) z = x + y (d) z = x + 3 y

70. Solve the linear programming problem: Max. z = x + 2 y subjected to constraints: x − y  10 ,

2 x + 3 y  20 , x  0 , y  0
(a) Max. z = 10 (b) Max. z = 30 (c) Max. z = 40 (d) Max. z = 50

************

Prepared By : Linge Gowda A P (99160 23722) Page 20