CLASS: XII MATHEMATICS (041)

CHAPTER12:LINEAR PROGRAMMING PROBLEM

Q1 The solution set of the inequation 2 x + y>5 is

(a) half plane that contains the origin
(b) open half plane not containing the origin
(c) whole xy-plane except the points lying on the line 2x+y=5
(d) none of these
Q2 Objective function of a LPP is
(a) a constraint
(b) a function to be optimized
(c) a relation between the variables
(d) none of these
Q3 Which of the following sets are convex?
(a) ((x, y): x² + y² ≥1)
(b) ((x, y): y² ≥x}
(c) ((x, y): 3x²+4y² ≥5}
(d) ((x, y): y≥2, y ≤4}
Q4 Let X1 and X2 are optimal solutions of a LPP, then
(a) X = 𝜆X₁+(1-𝜆) X2, 𝜆𝜖R is also an optimal solution
(b) X=𝜆X₁+(1-𝜆) X2,0≤𝜆≤1 gives an optimal solution
(c) X = 𝜆X1+ (1 + 𝜆) X2,0≤𝜆≤1 give an optimal solution
(d) X=𝜆X1+(1+𝜆) X2, 𝜆𝜖R gives an optimal solution
Q5 The maximum value of Z=4x+2y subjected to the constraints
2x+3y ≤18, x+y≥10; x, y ≥ 0 is
(a) 36
(b) 40
(c) 20
(d) none of these
Q6 The optimal value of the objective function is attained at the points
(a) given by intersection of inequations with the axes only
(b) given by intersection of inequations with x-axis only
(c) given by corner points of the feasible region
(d) none of these
Q7 The maximum value of Z=4x+3y subjected to the constraints
3x+2y≥160, 5x+2y≥200, x + 2y ≥80; x, y ≥ 0 is
(a) 320
(b) 300
(c) 230
(d) none of these
Q8 Consider a LPP given by
Minimum Z = 6x + 10 y
Subjected to x ≥ 6; y ≥ 2; 2x + y ≥ 10; x, y ≥0
Redundant constraints in this LPP are
(a) x 20, y ≥0
(b) x≥6,2x+y≥10
(c) 2x+y≥10
(d) none of these
Q9 The objective function Z=4x+3y can be maximised subjected to the
constraints
3x + 4y ≤ 24,8 x + 6 y ≤ 48, x ≤5, y ≤ 6) x, y ≥ 0
(a) at only one point
(b) at two points only
(c) at an infinite number of points
(d) none of these
Q10 If the constraints in a linear programming problem are changed
(a) the problem is to be re-evaluated
(b) solution is not defined
(c) the objective function has to be modified
(d) the change in constraints is ignored
Q11 Which of the following statements is correct?
(a) Every LPP admits an optimal solution
(b) A LPP admits unique optimal solution
(c) If a LPP admits two optimal solutions it has an infinite number of
optimal solutions
(d) The set of all feasible solutions of a LPP is not a converse set

Q 12 Which of the following is not a convex set?

(a) ((x, y): 2x+5y <7)
(b) ((x, y): x² + y² ≤ 4)
(c){x:lxl =5)
(d) ((x, y): 3x² + 2y² ≤ 6
Q13 By graphical method, the solution of linear programming problem
Maximize Z = 3X+5Y
Subject to 3X+2Y ≤18,X ≤ 4,Y ≤ 6, X ≥ 0, Y ≥ 0
(a) X = 2, Y= 0, Z = 6
(b) X = 2, Y = 6, Z = 36
(c) X = 4, Y = 3, Z = 27
(d) X = 4, Y = 6, Z = 42

Q14 The region represented by the inequation system x, y ≥ 0, y ≤ 6,

x + y ≤ 3 is
(a) unbounded in first quadrant
(b) unbounded in first and second quadrants
(c) bounded in first quadrant
(d) none of these
Q15 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)

Q16 The value of objective function is maximum under linear constraints

(a) at the centre of feasible region
(b) at (0, 0)
(c) at any vertex of feasible region
(d) the vertex which is at a maximum distance from (0, 0)

Q 17 The graph of the inequality 2x + 3y > 6 is

(a) half plane that contains the origin
(b) half plane that neither contains the origin nor the points on the line 2x
+ 3y=6
(c) whole XOY-plane excluding the points on the line 2x + 3y = 6
(d) entire XOY plane

Q 18 The objective function of an LPP is

(a) a constant
(b) a linear function to be optimized
(c) an inequality
(d) a quadratic expression

Q 19 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 occurs at both the points (15, 15) and (0, 20) is
(a) p= q
(b) p=2q
(c) q=2p
(d) q=3p

Q 20 The maximum value of z=4x+3y, if the feasible region for an LPP is as

shown in Fig.

(a) 100
(b) 72
(c) 112
(d) none of these
Q 21 The minimum value of z=3x+2y, if the feasible region for an LPP is as
shown in Fig 24.9, is
(a) 36
(b) 16
(c) 20
(d) 13

Q 22 The point which lies in the half-plane 2x+y-4=0 is

(a) (0,8) (b) (1,1) (c) (5,5) (d) (2,2)

Q 23 The corner points of the bounded feasible region of an LPP are O (0,0), A
(250, 0), B (200, 50) and C (0,175). If the maximum value of the
objective function Z=2ax+by occurs at the points A (250, 0) and B
(200,50), then the relation between a and b is:

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

Q 24 A linear programming problem (LPP) along with its constraints:

Minimize: Z = 3x + 2y. Subject to: x≤4, x≥0, y ≥0
Which of the following is true about the above LPP?
(a) It has no solution
(c) It has two distinct solutions
(b) It has a unique solution
(d) It has infinitely many solutions.
Q 25 The constraints of a linear programming problem along with their graphs
are shown below:
x+2y≥ 3,x≥10, y≥0
Which of the following objective
functions has an optimal
solution with respect to the above set of
constraints?
(a) Minimise Z=x+y
(b) Minimise Z = 0.5x + y
(c) Maximise Z = x+y
(d) Maximise Z = 2x + y
Q 26 A linear programming problem (LPP)
along with the graph of its constraints is
shown in the figure. The corresponding
objective function is Minimize:
Z=3x+2y. The minimum value
of the objective function is obtained at
the corner point (2, 0).
The optimal solution of the above linear
programming problem

(a) does not exist as the feasible region is unbounded.

(b) does not exist as the inequality 3x + 2y <6 does not have any point in
common with the
feasible region.
(c) exists as the inequality 3x + 2y > 6 has infinitely many points in
common with the
feasible region.
(d) exists as the inequality 3x + 2y <6 does not have any point in
common with the feasible
region.
Q 27 The feasible region of a linear programming problem is bounded. The
corresponding objective function is Z=6x-7y.
The objective function attains
(a) only minimum
(b) only maximum
(c) both maximum and minimum in the feasible region.
(d) either maximum or minimum but not both

Q 28 Corner points of the feasible region determined by the system of linear

constraints (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 occurs at
(3,0) and (1, 1) is
(a) p=2q
(b) 2p=q
(c) p = 3q
(d) p=9

Q 29 Corner points of the feasible region for an LPP are: (0,2), (3, 0), (6,0), (6,
8) and (0,5). Let z=4x+6y the objective function. The minimum value of z
occurs at
(a) (0,2) only
(b) (3,0) only
(c) the mid-point 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)
Q 30 The objective function Z=ax+by of an LPP has maximum value 42 at (4,
6) and minimum value 19 at (3, 2). Which of the following is true?
(a) a=9,b=1
(b) a=5,b=2
(c) a=3,b=5
(d) a=5,b=3

Q 31 The corner points of the feasible region of a linear programming problem

are (0,4), (8,9) and (20/3,4/3). If Z=30x+24y is the objective function,
then (Maximum value of Z-Minimum value of
(a) 40
(b) 96
(c) 120
(d) 144

ASSERTION AND REASONING TYPE QUESTIONS

Choose the correct option for following assertion reasoning

questions:

(a) Both A and R are true and R is the correct explanation of A

(b) Both A and R are true but R is NOT the correct explanation of A
(c) A is true but R is false.
(d) A is false but R is true.

Q 32 Assertion (A): Feasible region is the set of points which satisfy all of
the given constraints.
Reason (R): The optimal value of the objective function is attained at the
points on X-axis only.

Q 33 Assertion (A): It is necessary to find objective function value at every

point in the feasible region to find optimum value of the objective
function.
Reason(R):For the constrains 2x+3y≤ 6, 5x+3y ≤15, x≥ 0 and y≥0
corner points of the feasible region are (0,2), (0,0) and (3,0).

Q 34 Assertion (A):Consider the linear programming problem. Maximise

Z=4x+y Subject to constraints x+ y≤50; x+ y ≥100 and x, y ≥0. Then,
maximum value of Z is 50.
Reason (R):If the shaded region is bounded then maximum value of
objective function can be determined.

Q 35 Assertion (A) : For the constraints of linear optimizing function Z = x1+

x2 given by x1+ x2 ≤ 1, 3x1 + x2 ≤ 1,x ≥0 and y≥0 there is no feasible
region.
Reason (R): Z = 7x + y, subject to 5x + y ≤5, x + y ≤ 3, x ≥0 and y≥0.
The corner points of the feasible region are ( ½ ,5/2), (0,3) and (0,5).

Q 36 Assertion (A): For the constraints of a LPP problem given by x1 +

2x2 ≤ 2000, x1 + x2 ≤ 1500, x2 ≤ 600 and x1, x2 ≥ 0 the points (1000, 0),
(0, 500),(2, 0) lie in the positive bounded region, but point (2000, 0)
does not lie in the positive bounded region.
 Reason (R):

Q 37 Assertion (A): The maximum value of Z = 11x+7y. Subject to the

constraints 2x+y ≤6, x ≤2, x,y ≥0 Occurs at the point (0,6).

Reason (R): If the feasible region of the given LPP is bounded, then the
maximum and minimum values of the objective function occurs at corner
points.

Q 38 Assertion(A):If an LPP attains its maximum value at two corner points of

the feasible region then it attains maximum value at infinitely many
points.
Reason (R): if the value of the objective function of a LPP is same at two
corners then it is same at every point on the line joining two corner
points.
Q 39 Consider, the graph of constraints stated as linear inequalities as below:

5x+y ≤100,x+y ≤60, x,y ≥0.

Assertion (A): The points (10,50), (0,60) ,
(10,10) and (20,0) are feasible

Reason (R): Points within and on the

boundary of the feasible region represent
feasible solutions of the constraints.

Q 40 Assertion (A):For an objective function Z= 15x + 20y, corner points are

(0,0), (10,0), (0,15) and (5,5). Then optimal values are 300 and 0
respectively.
Reason (R):The maximum or minimum value of an objective function is
known as optimal value of LPP. These values are obtained at corner
points.

Q 41 Assertion (A): For the LPP Z= 3x+2y, subject to the constraints

x+2y ≤ 2; x ≥0; y≥ 0 both maximum value of Z and Minimum value of Z
can be obtained.
Reason (R):If the feasible region is bounded then both maximum and
minimum values of Z exists.
Q 42 Assertion (A):The linear programming problem, maximize Z = x+2y
subject to constraints x-y ≤10,2x + 3y ≤ 20 and x≥ 0; y ≥0. It gives the
maximum value of Z as 40/3.
Reason (R):To obtain maximum value of Z, we need to compare value of
Z at all the corner points of the shaded region.
 ANSWERS:

1.(b) 2. (b) 3. (d) 4. (b) 5. (d) 6. (c) 7. (d) 8. (c) 9.(c) 10.(a)

11.(c) 12.(c) 13.(b) 14.(c) 15.(d) 16.(d) 17.(b) 18.(b) 19.(d) 20.(c)

21.(d) 22.(b) 23.(a) 24.(b) 25.(a) 26.(d) 27.(c) 28.(b) 29.(d) 30. (c)

31.(d) 32. (c) 33.(d) 34.(d) 35.(a) 36. (a) 37. (a) 38. (a) 39. (a) 40. (a)

41. (a) 42. (a)