LINEAR INEQUALITIES

1) The solution set of |4 x−3|< 27

−15
a) [−6 , 2 ] b) ¿)

c) ¿ d) ¿)

OPTION-B
|4 x−3|< 27
−27< ( 4 x−3 )<27
−24 <4 x <30
15
−6< x <
2
15
x ∈(−6 , )
2

2) If |x +2|≤ 9then
a) x ∈ (−7,11 ) b) x ∈ [ −11,7 ]
c) x ∈ (−∞ ,−7 ) U (11 , ∞) d) x ∈ (−∞ ,−7 ) U ¿

OPTION-B
−9 ≤ x+2 ≤ 9
−9−2 ≤ x ≤ 9−2
−11 ≤ x ≤ 7
x ∈[−11,7 ]
3) The set of values of x for which the inequality |x−1|+|x+1|< 4 always holds true
is .
a) (−2,2 ) b) (−∞ , 2 ) U ( 2 , ∞ )
c) (−∞ ,−1 ] U [ 1 , ∞ ) d) None of these

OPTION-A
−2 x−∞< x ←1

|x−1|+|x+1|=¿ 2−1 ≤ x ≤ 1

2 x 1< x <∞

−2 x< 4 and −∞< x ←1

x >−2 and x ∈(−∞ ,−1)

x ∈ (−2 ,−1 )

2< 4 and −1 ≤ x ≤1 x ∈ [ −1,1 ]

2 x< 4 and 1< x <∞

x <2 and x ∈ ¿)

x ∈ ( 1,2 )

The solution set = (−2,1 ) U [−1,1 ] U (1,2)

= (−2,2)

4) If |x−1|> 5 ,then
a) x ∈(−4,6) b) x ∈[−4,6]
c) x ∈ (−∞ ,−4 ) U ( 6 , ∞ ) d) x ∈ (−∞ ,−4 ] U ( 6 , ∞ )

OPTION-C
We have, |x−1|> 5
x−1←5 or x−1>5

x ←4 or x >6

x ∈ (−∞ ,−4 ) or x ∈ ( 6 , ∞ )

x ∈ (−∞ ,−4 ) U ( 6 , ∞ )

OPTION-C
We have,|x−1|> 5
x−1←5∨x −1> 5

x ←4∨x >6

x ∈ (−∞ ,−4 ) ∨x ∈(6 , ∞)

1
| |
5) Solution set of x + x >2 is

a) R-{0} b) R-{-1,0,1}
c) R-{1} d) R-{0,1}

OPTION-B

|x + 1x |>2
x2 +1
>2
|x|
Now, x<0 we have
x 2+ 1+ 2 x >0

( x +1)2 >0 is true for all x except x=1

Therefore solution = R-{-1,0,1}

6) The solution set of 6+ x− x2 >0 is
a) −1< x <2 b)−2< x <3
c) −2< x ←1 d) None of these

OPTION-B
6+ x− x2 >0 ( x−3 ) ( x+ 2 )< 0

−2< x <3

7) If −3 x+ 17←13 them
a) x ∈(10 , ∞ ) b) x ∈ ¿
d) x ∈ (−∞ ,10 ) d) x ∈ [ −10 ,−10 ]

OPTION-A
−3 x+ 17←13
−3 x ←13−17
−3 x ←30
x >10 x ∈(10 , ∞ )

8) Number of pairs of consecutive even integers, both of which smaller than 12

such that their sum is greater than 14.
a) 1 b) 2
c) 3 d) 4

OPTION-A
Let x and x+2 be two consecutive even integers such that x<12 & 2x+2>14
x <12∧x >6

6< x <12

Thus the pair of numbers is (8,10)

9) If [x] denotes the greatest integer less than or equal to , then the solution of
[ x ] −6
>0 is
8−[ x]

a) (6,7) b) [7,8) c) [6,7) d) [6,7]

OPTION-B
[ x ] −6
>0
8−[ x]

6<[x]<8
[x]=7 x∈¿

10) If x <5then
a) −x ←5 b) −x ≤−5
c) −x >−5 d)−x ≥−5

OPTION-C
If a>b then –a< -b
Therefore x<5 −x >−5
 Linear Programming

1) The solution set of inequalities x ≥ 0 and y ≤0 is

a) First quadrant b) Second quadrant
c) Third quadrant d) Fourth quadrant

OPTION-D
The set { ( x , y ) : x ≥ 0 , y ≤ 0 } represents the set of all points in fourth quadrant

2) The feasible region of an L.P.P is always

a) a closed set b) an unbounded set

c) a bounded set d) a convex set

OPTION-D
By definition, the feasible region of an L.P.P is convex set.

3) Which of the following set in convex

a) {( x , y ) : x 2 + y 2 ≥ 1}
b) {( x , y ) :2 x 2+5 y 2 ≤3 }

c) {( x , y ) : 4 ≤ x 2 + y 2 ≤7 }

d) {( x , y ) :5 ≤ 2 x 2 +5 y 2 ≤ 3 }

OPTION-B
Clearly the set in option (b) is convex set

This set represents the set of all points within the ellipse,

x2 y2
+ =1
3/2 3/5

4) Optimization of the objective function is a process of

a) maximizing the objective function

b) minimizing the objective function

c) maximizing or minimizing the objective function

d) None of these

OPTION-C
By the definition option (c) is correct

5) Solution set of the inequality y ≤0 is

a) Half the plane below x-axis, including the points on x-axis.

b) Half plane above x-axis

c) Half plane below x-axis, including the points on x-axis

d) Half plane above x-axis, including the points on x-axis.

OPTION-C
By the graph, option (c) is the correct option.

6) The minimum value of linear objective function x=5 x+ 2 y is subjected to

10 x+ 2 y ≥ 20, 5 x+ 5 y ≥ 30, x ≥ 0 , y ≥0 is

a) 10 b)15 c) 20 d)25

OPTION-B
Clearly the feasible region is an unbounded region. Thus the minimum occurs at
the point of intersection of 10 x+ 2 y =20 and 5 x+ 5 y =30, which is (1,5).

Thus the minimum value = 5(1) + 2(5)

= 15

7) Maximum value of z=3 x +2 y subjected to 0 ≤ x ≤ 3 , 0 ≤ y ≤ 3, x + y ≤ 5, 2 x+ y ≥ 4 is

a) 10 b) 11 c) 12 d) 13

OPTION-D
Clearly the vertices of feasible region are
 1
A ( 2,0 ) , B ( 3,0 ) , C ( 3,2 ) , D ( 2,3 ) , E ( , 3)
2

z=3 x +2 y will be maximum at C ( 3,2 )

z=3 ( 3 ) +2 ( 2 )

¿13

8) 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 minimum of z occurs at (3,0) and (1,1) is

a) p=2q b) p=-q/2 c) p=3q d) p=q

OPTION-B
We have z= px+ qy

Z min occur at (3,0) and (1,1)\Therefore, 3 p= p+ q

2 p=q

p=−q/2

Made with , ,by Pratheek.