LINEAR PROGRAMMING PROBLEM

Total No.of questions in Linear programming problem are -

Level # 1 .................................................................................... 51
Level # 2 .................................................................................... 17

Total No. of questions .............................................................. 68

 LEVEL # 1
Questions Q.6 For the following shaded area, the linear
based on
Graphs of Linear inequations constraints except x  0 and y  0, are -
Y
Q.1 Inequation y – x  0 represents -
(A) The half plane that contains the positive x
+
2y

1
x-axis =

y=
8
(B) Closed half plane above the line y = x

–
2x

x
which contains positive y- axis

+
y
(C) Half plane that contains the negative

=
2
x-axis O X
(D) None of these

Q.2 The position of points O (0,0) and P (2,–2) in (A) 2x + y  2, x – y  1, x + 2y  8

the region of graph of inequations (B) 2x + y  2, x – y  1, x + 2y  8
2x – 3y < 5, will be - (C) 2x + y  2, x – y  1, x + 2y  8
(A) O inside and P outside (D) 2x + y  2, x – y  1, x + 2y > 8
(B) O and P both inside
Q.7 The solution set of constraints x + 2y  11,
(C) O and P both outside 3x + 4y  30, 2x + 5y  30, x  0, y  0
(D) O outside and P inside includes the point -
(A) (2, 3) (B) (3, 2)
Q.3 The solution set of the inequation (C) (3, 4) (D) (4, 3)
2x + y > 5 is -
(A) half plane that contains the origin Q.8 The region represented by the inequation
(B) open half plane not containing the origin system x, y  0, y  6, x + y  3, is-
(A) Unbounded in first quadrant
(C) whole xy-plane except the points lying
on the line 2x + y = 5 (B) Unbounded in first and second quadrants
(C) Bounded in first quadrant
(D) None of these
(D) None of these
Q.4 If a point ( h,k) satisfies an inequation Q.9 In equations 3x – y > 3 and 4x – y > 4 -
ax + by 4, then the half plane represented
(A) have solution for positive x and y
by the inequation is -
(B) have no solution to positive x and y
(A) the half plane containing the point (h,k)
(C) have solution for all x
but excluding the points on ax + by = 4
(D) have solution for all y
(B) the half plane containing the point (h,k)
and the points on ax + by = 4
Q.10 The graph of x  2 and y  2 will be situated
(C) whole xy-plane in the -
(D) None of these (A) First and second quadrant
(B) Second and third quadrant
Questions Simultaneous Linear inequations (C) First and third quadrant
based on in two variables (D) Third and fourth quadrant

Q.5 The vertex of common graph of inequalities Q.11 The solution set of linear constraints
2x + y  2 and x – y  3, is - x – 2y  0, 2x – y  – 2 and x, y  0, is-
5 4  4 2
(A) (0, 0) (B)  3 ,   (A)   ,  (B) (1,1)
3  3 3
 5 4  4 5  2
(C)  3 , 3  (D)   3 , 3  (C)  0,  (D) (0,2)
 3
Q.12 A vertex of a feasible region by the linear Q.18 For the following feasible region, the linear
constraints 3x + 4y  18, 2x + 3y  3 and constraints except x  0 and y  0, are -
x, y  0, is -
(A) (0, 2) (B) (4.8, 0)
(C) (0, 3) (D) None of these Y
X = 250
Q.13 In which quadrant, the bounded region for
inequations x + y  1 and x – y  1 is
situated- y = 350
(A) I,II
(B) I,III
(C) II, III
(D) All the four quadrants X
O
Q.14 The necessary condition for third quadrant
region in x – y plane, is-
(A) x > 0, y < 0 (B) x < 0, y < 0 (A) x  250, y  350, 2x + y = 600
(C) x < 0, y > 0 (D) x < 0, y = 0 (B) x  250, y  350, 2x + y = 600
(C) x  250, y  350, 2x + y  600
Q.15 The graph of inequations x  y and (D) x  250, y  350, 2x + y  600
y > x + 3 located in -
(A) II quadrant
Q.19 A wholesale merchant wants to start the
(B) I,II quadrants
business of cereal with Rs.24,000. Wheat is
(C) I,II,III quadrants Rs.400 per quintal and rice is Rs.600 per
(D) II, III, IV quadrants quintal. He has capacity for store 200 quintal
cereal. He earns the profit Rs.25 per quintal
Q.16 For the following feasible region, the linear on wheat and Rs.40 per quintal on rice. If he
constraints are -
store x quintal rice and y quintal wheat, then
Y
for maximum profit the objective function is -
(A) 25x + 40y (B) 40x + 25y
400 600
(C) 400x + 600y (D) x y
40 25

Questions
based on
Formulation of linear programming
O 3x x+ X
+ 3y
2y =1
= 1 Q.20 A shopkeeper wants to purchase two articles
12
A and B of cost price Rs. 4 and 3 respectively.
(A) x  0, y  0, 3x + 2y  12, x + 3y  11 He thought that he may earns 30 paise by
(B) x  0, y  0, 3x + 2y  12, x + 3y  11 selling article A and 10 paise by selling article
(C) x  0, y  0, 3x + 2y  12, x + 3y  11 B. He has not to purchase total article more
(D) None of these than Rs. 24. If he purchases the number of
articles of A and B, x and y respectively,
Q.17 The region represented by 2x + 3y – 5  0 then linear constraints are -
and 4x – 3y + 2  0, is- (A) x  0, y  0, 4x + 3y  24
(A) Not in first quadrant (B) x  0, y  0, 30x + 10y  24
(B) Bounded in first quadrant (C) x  0, y  0, 4x + 3y  24
(C) Unbounded in first quadrant (D) x  0, y  0, 30x + 40y  24
(D) None of these
Q.21 In a factory of producing two product A and Q.26 The minimum value of objective function
B. In the manufacturing of product A, the c = 2x + 2y in the given feasible region, is-
machine and the carpenter requires 3 hours Y
each and in manufacturing of product B, the
machine and carpenter requires 5 hours and x+ 5y = 200
3 hours respectively. The machine and
carpenter works at most 80 hours and 50 hours
per week respectively. The profit on A and B
is Rs.6 and 8 respectively. If profit is
maximum by manufacturing x and y units of
A and B type product respectively, then for X
O
the function 6x + 8y the constraint are -
(A) x 0, y  0, 5x + 3y  80, 3x + 2y  50
(A) 134 (B) 40 (C) 38 (D) 80
(B) x  0, y  0, 3x + 5y  80, 3x + 3y  50
(C) x  0, y  0, 3x + 5y  80, 2x + 3y  50
Q.27 Which of the following statements is correct?
(D) x  0, y  0, 5x + 3y  80, 3x + 2y  50
(A) Every L.P.P. admits an optimal solution
Q.22 Objective function of a L.P.P. is - (B) A L.P.P. admits a unique solution
(A) a constraint (C) If a L.P.P. admits two optimal solutions,
then it has an infinite number of optimal
(B) a function to be optimized
solutions.
(C) a relation between the variables
(D) A L.P.P. admits two optimal solutions.
(D) None of these
Q.28 For the L.P. problem Max z = 3x 1 + 2x2 such
Questions
Graphical method of solution that 2x1 – x2  2, x1 + 2x2  8 and x1,
based on
x2  0, then z =
(A) 12 (B) 24
Q.23 The optimal value of the objective function (C) 36 (D) 40
is attained at the points -
(A) given by intersection of inequations with Q.29 The L.P. problem Max z = x 1 + x 2 such that
the axes only. – 2x1 + x2  1, x1  2, x1 + x2  3 and
(B) given by intersection of inequations with x1, x2  0 has -
x-axis only (A) One solution
(C) given by corner points of the feasible (B) Three solution
region
(C) An infinite number of solutions
(D) None of these
(D) None of these

Q.24 For the constraint of a linear optimizing

Q.30 For the L.P. problem Min z = – x1 + 2x2 such
function z = x1 + x 2, given by x1 + x2  1,
that – x1 + 3x2  0, x1 + x2  6, x1 – x2 
3x1 + x2  3 and x1, x2  0-
2 and x1, x2  0, then x1 =
(A) There are two feasible regions
(A) 2 (B) 8
(B) There are infinite feasible regions (C) 10 (D) 12
(C) There is no feasible region
(D) None of these Q.31 The intermediate solutions of constraints must
be checked by substituting them back into-
Q.25 On maximizing z = 4x + 9y subject to (A) Object function
x + 5y  200, 2x + 3y  134 and x, y  0, (B) Constraint equations
then z = (C) Not required
(A) 380 (B) 382 (D) None of these
(C) 384 (D) None of these
Q.32 The maximum v alue of Z = 4x + 2y Q.39 “The Maximum or the Minimum of the
subjected to the constraints 2x + 3y  18, objective function occurs only at the corner
x + y  10; x, y  0, is- points of the feasible region.” This theorem
(A) 36 (B) 40 is known as Fundamental Theorem of -
(C) 20 (D) None of these (A) Algebra (B) Arithmetic
(C) Calculus (D) Extreme points
Q.33 For the L.P. problem Min z = 2x1 + 3x2 such
that –x1 + 2x2  4, x1 + x2  6, x1 + 3x2 > 9 Q.40 The feasible solution of a L.P.P. belongs to-
and x1, x2  0 (A) First and second quadrant
(A) x1 = 1.2 (B) x2 = 2.6 (B) First and third quadrant
(C) z = 10.2 (D) All the above (C) Second quadrant
(D) Only first quadrant
Q.34 For the L.P.problem Min z = x 1 + x 2 such
that 5x1 + 10x2  0, x1 + x2 1, x 2  4 and Q.41 If the constraints in a linear programming
x1, x2  0 - problem are changed-
(A) There is a bounded solution (A) the problem is to be re- evaluated
(B) There is no solution (B) solution is not defined
(C) There are infinite solutions (C) the objective function has to be modified
(D) None of these (D) the change in constraints is ignored

Q.35 The minimum value of P = 6x + 16 y subject

Q.42 The maximum value of objective function
to constraints x  40, y  20 and x,y  0 is-
c = 2x + 3y in the given feasible region, is-
(A) 240 (B) 320
(C) 0 (D) None of these Y

Q.36 For the constraints of a L.P. problem given

2x + y = 14
by x1 + 2x2  2000, x1 + x 2  1500, x2  600
and x1, x2  0, which one of the following
points does not lie in the positive bounded
region-
(A) (1000,0) (B) (0,500)
X
(C) (2,0) (D) (2000, 0) O

Q.37 If the number of available constraints is 3 and

the number of parameters to be optimized is (A) 29 (B) 18
4, then- (C) 14 (D) 15
(A) The objective function can be optimized
(B) The constraints are short in number Q.43 The value of objective function is maximum
(C) The solution is problem oriented under linear constraints-
(D) None of these (A) At the centre of feasible region
(B) At (0,0)
Q.38 For the L.P. problem Max z = 3x + 2y subject (C) At any vertex of feasible region
to x + y  1, y – 5x  0, x – y  – 1, x + y (D) The vertex which is maximum distance
 6, x  3 and x, y  0 - from (0,0)
(A) x = 3 (B) y = 3
(C) z = 15 (D) All three correct
Q.44 The solution for minimizing the function Q.50 Which of the following sets are not convex -
z = x + y under a L.P.P. with constraints (A) {(x,y) | 3  x 2 + y2  5}
x + y  1, x + 2y  10, y  4 and x, y  0 (B) {(x,y) | 3x 2 + 2y2  6}
is - (C) {(x,y) | y2  x}
(A) x = 0, y = 0, z = 0 (D) {(x,y) | x  2, x  3}
(B) x = 3, y = 3, z = 6
(C) There are infinite solution Q.51 Which of the following sets are convex-
(D) None of these (A) {(x,y) | x 2 + y2  1}
(B) {(x,y) | y2  x}
Q.45 The Maximum value of the objective function (C) {(x,y) | 3x 2 + 4y2  5}
P = 5x + 3y, subject to the constraints x  0, (D) {(x,y) | y  2, y  4}
y  0 and 5x + 2y  10 is-
(A) 6 (B) 10
(C) 15 (D) 25

Q.46 The point at which the maximum value of

x + y, subject to the constraints x + 2y  70,
2x + y  95, x, y  0 is obtained, is -
(A) (30, 25) (B) (20, 35)
(C) (35, 20) (D) (40, 15)

Q.47 The solution of a problem to maximize the

objective function z = x + 2y under the
constraints x –y  2, x + y  4 and
x, y  0, is-
(A) x = 0, y = 4, z = 8
(B) x = 1, y = 2, z = 5
(C) x = 1, y = 4, z = 9
(D) x = 0, y = 3, z = 6

Q.48 To maximize the objectiv e f unction

z = 2x + 3y under the constraints
x + y  30, x – y  0, y  12, x  20,
y  3 and x, y  0, is at -
(A) x = 12 , y = 18 (B) x = 18 , y = 12
(C) x = 12, y = 12 (D) x = 20, y = 10

Q.49 If 3x1 + 5x2  15

5x1 + 2x2  10
x1, x2  0
then the maximum value of 5x 1 + 3x2 by
graphical method is -
7 1
(A) 12 (B) 12
19 7
3
(C) 12 (D) 12
5
 LEVEL # 2
Q.1 A firm makes pants and shirts. A shirt takes Time taken Marks Number of
2 hours on machine and 3 hours of man to solve questions
labour while a pent takes 3 hours on machine
and 2 hours of man labour. In a week there Short answered 5 minutes 3 10
are 70 hours machine and 75 hours of man questions
labour available. If the firm determine to make Long answered 10 minutes 5 14
x shirts and y pants per week, then for this question
the linear constraints are-
(A) x  0, y  0, 2x + 3y  70, 3x + 2y  75 The total marks are 100. Student can solve
(B) x  0, y  0, 2x + 3y  70, 3x + 2y  75 all the questions. To secure maximum marks,
student solve x short answered and y long
(C) x  0, y  0, 2x + 3y  70, 3x + 2y  75 answered questions in three hours, then the
(D) x  0, y  0, 2x + 3y  70, 3x + 2y  75 linear constraints except x  0, y  0 are-
(A) 5x + 10y  180, x  10, y  14
Q.2 Mohan wants to invest the total amount of (B) x + 10y  180, x  10, y  14
Rs. 15,000 in saving certificates and national (C) 5x + 10y  180, x  10, y  14
saving bonds. According to rules, he has to (D) 5x + 10y  180, x  10, y  14
invest at least Rs. 2000 in saving certificates
and Rs. 2500 in national saving bonds. The Q.5 The objective function for the above question
interest rate is 8% on saving certificate and is -
10% on national saving bonds per annum. (A) 10 x + 14 y (B) 5x + 10 y
He invest Rs. x in saving certificates and Rs. (C) 3x + 5y (D) 5y + 3x
y in national saving bonds. Then the objective
function for this problem is Q.6 The vertices of a feasible region of the above
question are-
x y
(A) 0.08x + 0.10y (B) + (A) (0, 18), (36, 0)
2000 2500
(B) (0, 18), (10, 13)
x y
(C) 2000x + 2500y (D) + (C) (10, 13), (8, 14)
8 10
(D) (10, 13), (8, 14), (12, 12)
Q.3 Two tailors A and B earns 15 Rs. and 20 Rs.
Q.7 The maximum value of objective function in
per day respectively. A can make 6 shirts
the above question is-
and 4 pants in a day while B can make 10
(A) 100 (B) 92 (C) 95 (D) 94
shirts and 3 pants. To spend minimum on 60
shirts and 40 pants, A and B working x and Q.8 A firm produces two types of product A and
y days respectively. Then linear constraints B. The profit on both is Rs.2 per item. Every
except x  0, y  0, are - product processing on machines M1 and M2.
(A) 15x + 20y  0, 60x + 40y  0 For A, machines M1 and M2 takes 1 minute
(B) 15x + 20y  0, 6x + 10y = 0 and 2 minutes respectively and that of for B,
machines M1 and M2 takes the time 1 minute
(C) 6x + 10y  60, 4x + 3y  40
and 1 minute. The machines M1, M2 are not
(D) 6x + 10y  60, 4x + 3y  40 available more than 8 hours and 10 hours
any of day respectively. If the products made
Q.4 In a test of Mathematics, there are two types x of A and y of B, then the linear constraints
for the L.P.P. except x  0, y  0, are-
of questions to be answered - short answered
and long answered. The relevant data are (A) x + y  480, 2x + y  600
given below (B) x + y  8, 2x + y  10
(C) x + y  480, 2x + y  600
D x + y  8, 2x + y   10
Q.9 The objective function in the above question maximum profits company produces x
is- telephones of A type and y telephones of B
(A) 2x + y (B) x + 2y types. Then except x  0 and y  0, linear
(C) 2x + 2y (D) 8x + 10y constraints are-
(A) x + 2y  400; x + y  300
Q.10 The sum of two positive integers is at most Max z = 300 x + 400 y
5. The difference between two times of second (B) 2x + y  400 ; x + y  300
number and first number is at most 4. If the Max z = 400 x + 300 y
first number is x and second number is y,
(C) 2x + y  400; x + y  300
then for maximizing the product of these two
numbers, the mathematical formulation is- Max z = 300 x + 400 y
(A) x + y  5, 2y – x  4, x  0, y  0 (D) x + 2y  400 ; x + y  300
(B) x + y  5, –2x + y  4, x  0, y  0 Max z = 300 x + 400 y
(C) x + y  5, 2y – x  4, x  0, y  0
Q.15 The probable region of the linear programming
(D) None of these
problem in the above question is of the type-
Q.11 The point at which the maximum value of (A) Bounded (B) Unbounded
x + y subject to the constraints (C) Parallelogram (D) Square
x y
2x + 5y  100, +  1, x, y  0 is Q.16 The vertices of the above region are-
25 40
obtained is- (A) (0,0), (0,200), (0, 300) and (400,0)
(A) (10, 20) (B) (20, 10) (B) (0,0), (0,200), (300, 0) and (200,100)
(C) (0,0), (0,200), (0, 300) and (200,100)
 50 40 
(C) (15, 15) (D)  ,  (D) (0,0), (0,300), (400, 0) and (200,100)
 3 3 
Q.12 In the examination of P.E.T. the total marks Q.17 The optimal solution of the above question is
of Mathematics are 300. If the answer is right, at -
marks provided 3 and if the answer is wrong, (A) (100, 200) (B) (0, 200)
marks provided –1. A student knows the
(C) (100, 150) (D) (200, 100)
correct answer of 67 questions and remaining
questions are doubtful for him. He takes the
time 1½ minutes to give the correct answer
and 3 minutes that for doubtful. Total time is
3 hours. In the question paper after every two
simple questions, one question is doubtful.
He solve the questions one by one, then the
number of questions solved by him, are-
(A) 67 (B) 90 (C) 79 (D) 80

Q.13 In the above question the minimum marks

obtained by the student, are-
(A) 96 (B) 144 (C) 192 (D) 150

Q.14 A company manufactures two types of

telephone sets A and B. The A type
telephone set requires 2 hours and B type
telephone requires 4 hours to make. The
company has 800 work hours per day. 300
telephone can pack in a day. The selling
prices of A and B types telephones are
Rs.300 and Rs.400 respectiv ely. For
 ANSWER KEY

LEVEL # 1
Q.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Ans. A A B B B B C C A A A D D B C A B D B A
Q.No. 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
Ans. B B C C B D C B C A B D D C C D B D D D
Q.No. 41 42 43 44 45 46 47 48 49 50 51
Ans. A B D C C D A B A A D

LEVEL # 2
Q.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
Ans. D A D A C C C A C C D B D A A B D