Sure Shot Questions

Chapter – 12
Linear Programming
 MCQ (1 mark)

1. 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 = 4x + 3y.
Compare the quantity in Column A and Column B
Column A Column B
(a) 0 (b) 8
Maximum of Z 325 (c) 12 (d) -18

(a) The quantity in column A is greater

(b) The quantity in column B is greater
(c) The two quantities are equal 4. Corner points of the feasible region for an LPP are
(d) The relationship cannot be determined on the (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
basis of the information suppled. Let F = 4x + 6y be the objective function.
The minimum value of F occurs at
2. The feasible region for a LPP is shown shaded in (a) (0, 2) only
the figure. Let Z = 3x – 4y be the objective function. (b) (3, 0) only
Minimum of Z occurs at (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)

5. 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 occurs at (3,
(a) (0, 0) (b) (0, 8) 0) and (1, 1) is
(c) (5, 0) (d) (4, 10) q
(a) p  2q (b) p 
2
3. The feasible region for an LPP is shown shaded in (c) p  3q (d) p  q
the figure. Let F = 3x – 4y be the objective function.
Maximum value of F is

6. Which of the following points satisfies both the

inequations 2x + y  10 and x  2 y  8 ?
[2023]
(a) (-2, 4) (b) (3, 2)
YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 1
 (c) (-5, 6) (d) (4, 2) (c) x  2 y  104 and 2 x  y  76
(d) x  2 y  104 and 2 x  y  38
7. The solution set of the inequation 3x + 5y < 7 is
[2023]
(a) Whole xy-plane except the points lying on the
12. If the minimum value of an objective function Z =
line 3x + 5y = 7.
ax + by occurs at two points (3, 4) and (4, 3) then
(b) Whole xy-plane along with the points lying on
[Term I, 2021 – 22]
the line 3x + 5y = 7.
(a) a + b = 0 (b) a = b
(c) Open half plane containing the origin except
(c) 3a = b (d) a = 3b
the points of line 3x + 5y = 7.
(d) Open half plane not containing the origin.
13. For the following LPP, maximise Z = 3x + 4y subject
[2023]
to constraints x  y  1, x  3, x  0, y  0 the
maximum value is [Term I, 2021 – 22]
8. If the corner points of the feasible region of an LPP
(a) 0 (b) 4
are (0, 3), (3, 2) and (0, 5), then the minimum value
(c) 25 (d) 30
of Z = 11x + 7y is [Term I, 2021 – 22]
(a) 21 (b) 33
14. The corner points of the feasible region
(c) 14 (d) 35
determined by the system of linear inequalities are
(0, 0), (4, 0), (2, 4) and (0, 5). If the maximum value
of z = ax + by, where a, b > 0 occur at both (2, 4)
9. The number of solutions of the system of
and (4, 0), then [2020]
inequations x  2 y  3,3x  4 y  12, x  0, y  1
(a) a = 2b (b) 2a = b
is [Term I, 2021 – 22] (c) a = b (d) 3a = b
(a) 0 (b) 2
(c) finite (d) infinite
15. In an LPP, if the objective function z = ax + by has
10. The maximum value of Z = 3x + 4y subject to the
the same maximum value on two corner points of
constraints x  0, y  0 and x  y  1 is
the feasible region, then the number of points at
[Term I, 2021 – 22] which zmax occurs is [2020]
(a) 7 (b) 4 (a) 0 (b) 2
(c) 3 (d) 10 (c) finite (d) infinite

11. The feasible region of an LPP is given in the 16. The feasible region for an LPP is shown below:
following figure [Term I, 2021 – 22] Let z = 3x – 4y be the objective function.
Minimum of z occurs at [NCERT Exemplar,
2020]

Then, the constraints of the LPP are x  0, y  0

and
(a) 2 x  y  52 and x  2 y  76
(b) 2 x  y  104 and x  2 y  76

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 2

 (a) (0, 0) (b) (0, 8) (b) (3, 0) only
(c) (5, 0) (d) (4, 10) (c) (0.6, 1.6) and (3.0) only
(d) At every point of the line – segment joining
the points (0.6, 1.6) and (3.0)
17. The graph of the inequality 2x + 3y > 6 is
[2020]
(a) Half plane that contains the origin
(b) Half plane that neither contains the origin nor 21. Based on the givens shaded region as the feasible
the points of the line 2x + 3y = 6. region in the graph, at which point(s) is the
(c) Whose XOY – plane excluding the points on objective function Z = 3x + 9y maximum?
the line 2x + 3y = 6. [Term I, 2021 – 22]
(d) Entire XOY – plane.

18. The objective function of an LPP is [2020]

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

19. The solution set of the inequality 3x + 5y < 4 is (a) Point B

[2022 – 23] (b) Point C
(a) An open half – plane not containing the (c) Point D
origin. (d) Every point on the line segment CD
(b) An open half – plane containing the origin.
(c) The whole XY – plane not containing the line 22. In the given graph, the feasible region for a LPP is
3x + 5y = 4. shaded. The objective function Z = 2x – 3y, will be
(d) A closed half plane containing the origin. minimum at [Term I, 2021 – 22]

20. The corner points of the shaded unbounded

feasible region of an LPP are (0, 4), (0.6, 1.6) and
(3, 0) as shown in the figure. The minimum value of
the objective function Z = 4x + 6y occurs at

(a) (4, 10) (b) (6, 8)

(c) (0, 8) (d) (6, 5)

23. In the feasible region, the minimum value of Z

occurs at [Term I, 2021 – 22]
(a) A unique point
[2022 – 23] (b) No point
(a) (0.6, 1.6) only (c) Infinitely many points
(d) Two points only
YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 3
 28. Assertion (A): The maximum value of Z = 11x + 7y
24. For an objective function Z = ax + by, where a, b > subject to the constraints 2x + y ≤ 6; x ≤ 2; x ≥ 0, y ≥
0; the corner points of the feasible region 0
occurs at the comer point (0, 6).
determined by a set of constraints (linear
Reason (R): If the feasible region of the given LPP is
inequalities) are (0, 20), (10, 10), (30, 30) and (0, bounded, then the maximum and minimum value of
40). The condition on a and b such that the the objective function occurs at corner points.
maximum Z occurs at both the points (30, 30) and a) Both A and R are true and R is the correct
(0, 40) is [Term I, 2021 – 22] explanation of A.
(a) b – 3a = 0 (b) a = 3b b) Both A and R are true but R is not the correct
(c) a + 2b = 0 (d) 2a – b = 0 explanation of A.
c) A is true but R is false.
d) A is false but R is true.

25. In a linear programming problem, the constraints

on the decision variables x and y are 29. Assertion (A): Consider the linear programming
problem. Maximise Z = 4x + y Subject to
x  3 y  0, y  0, 0  x  3 . The feasible region constraints x + y ≤ 50, x + y ≥ 100, and x, y ≥ 0.
[Term I, 2021 – 22] Then, maximum value of Z is 50.
(a) Is not in the first quadrant Reason (R): If the shaded region is not bounded
(b) Is bounded in the first quadrant then maximum value cannot be determined.
(c) Is unbounded in the first quadrant a) Both A and R are true and R is the correct
explanation of A.
(d) Does not exist
b) Both A and R are true but R is not the correct
explanation of A.
 Assertion-Reasoning (1 mark) c) A is true but R is false.
d) A is false but R is true.
26. Assertion (A): Maximum value of Z = 3x + 2y,
subject to the constraints x + 2y ≤ 2; x ≥ 0; y ≥ 0 will
30. Assertion (A): The maximum value of Z = x + 3y.
be obtained at point (2, 0).
Such
Reason (R): In a bounded feasible region, it always
that 2x + y ≤ 20, x + 2y ≤ 20, x, y ≥ 0 is 30.
exist a maximum and minimum value.
Reason (R): The variables that enter into the
a) Both A and R are true and R is the correct
problem are called decision variables.
explanation of A.
a) Both A and R are true and R is the correct
b) Both A and R are true but R is not the correct
explanation of A.
explanation of A.
b) Both A and R are true but R is not the correct
c) A is true but R is false.
explanation of A.
d) A is false but R is true.
c) A is true but R is false.
d) A is false but R is true.
27. Assertion (A): The maximum value of Z = 5x + 3y,
satisfying the conditions x ≥ 0, y ≥ 0 and 5x + 2y ≤
10, is 15.  Case Study Questions
Reason (R): A feasible region may be bounded or
unbounded. 31. Read the text carefully and answer the questions:
a) Both A and R are true and R is the correct Corner points of the feasible region for an LPP are
explanation of A. (0, 3), (5, 0), (6, 8), (0, 8). Let Z = 4x - 6y be the
b) Both A and R are true but R is not the correct objective function.
explanation of A.
c) A is true but R is false.
d) A is false but R is true.

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 4

 Subject to the constraints
[2023]
2 x  y  4
x y 3
x  2y  2
x  0, y  0

34. Solve the following linear programming problem

(a) At which corner point the minimum value of Z graphically.
occurs? Maximize: P = 70x + 40y
(b) At which corner point the maximum value of Z Subject to: 3x  2 y  9, 3x  y  9, x  0, y  0 .
occurs?
[2023]
(c) What is the value of (maximum of Z - minimum of
Z)?
(d) The corner points of the feasible region determined 35. Find graphically, the maximum value of 𝑧 = 2𝑥 +
by the system of linear inequalities are 5𝑦, subject to constraints given below:
2𝑥 + 4𝑦 ≤ 8
3𝑥 + 𝑦 ≤ 6
32. Read the text carefully and answer the questions: 𝑥+𝑦 ≤4
Dinesh is having a jewelry shop at Green Park, 𝑥 ≥ 0, 𝑦 ≤ 0
normally he does not sit on the shop as he remains
busy in political meetings. The manager Lisa takes
care of jewelry shop where she sells earrings and 36. Solve the following linear programming problem
necklaces. She gains profit of Rs 30 on pair of graphically :
earrings & Rs 40 on neckless. It takes 30 minutes to Maximize Z = 7𝑥 + 10𝑦
make a pair of earrings and 1 hour to make a Subject to the constraints
necklace, and there are 10 hours a week to make 4𝑥 + 6𝑦 ≤ 240
jewelry. In addition, there are only enough 6𝑥 + 3𝑦 ≤ 240
𝑥 ≥ 10
materials to make 15 total of jewelry items per
𝑥 ≥ 0, 𝑦 ≥ 0
week.
37. Solve the following LPP graphically: Minimize 𝑧 =
5𝑥 + 7𝑦 Subject to the constraints 2𝑥 + 𝑦 ≥
8 𝑥 + 2𝑦 ≥ 10 𝑥, 𝑦 ≥ 0

38. Solve the following LPP graphically: Minimise 𝑍 =

(a) Formulate the above information 5𝑥 + 10𝑦 Subject to constraints 𝑥 + 2𝑦 ≤
mathematically. 120, 𝑥 + 𝑦 ≥ 60, 𝑋 − 2𝑦 ≥ 0 and 𝑥, 𝑦 ≥ 0
(b) Graphically represent the given data.
(c) To obtain maximum profit how many pair of
earing and neckleses should be sold? 39. Maximise 𝑍 = 𝑥 + 2𝑦 Subject to the constraints:
(d) What would be the profit if 5 pairs of earrings 𝑥 + 2𝑦 ≥ 100,2𝑥 − 𝑦 < 0 2𝑥 + 𝑦 ≤ 200 𝑥, 𝑦 ≥
and 5 0 Solve the above LPP graphically.
necklaces are made?

 Questions 40. Find graphically, the maximum value of 𝑧 = 2𝑥 +

5𝑦, subject to constraints given below: 2𝑥 + 4𝑦 ≤
8, 3𝑥 + 𝑦 ≤ 6, 𝑥 + 𝑦 ≤ 4; 𝑥 ≥ 0, 𝑦 ≥ 0
33. Solve the following linear programming problem
graphically:
Maximise z = -3x – 5y

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 5

41. Maximise 𝑧 = 8𝑥 + 9𝑦 subject to the constraints
given below: 2𝑥 + 3𝑦 ≤ 6,3𝑥 − 2𝑦 ≤ 6, 𝑦 ≤
1; 𝑥, 𝑦 ≥ 0 43. Let 𝑧 = 𝑋 + 𝑦, then the maximum of z subject to
constraints 𝑦 ≥ |𝑥| − 1, 𝑦 ≤ 1 − |𝑥|, 𝑥 ≥
0, 𝑦 ≥ 0 𝑖𝑠
42. Minimise 𝑍 = 30𝑥 + 20𝑦 subject to 𝑥 + 𝑦 ≤
8, 𝑥 + 4𝑦 ≥ 12,5𝑥 + 8𝑦 ≥ 20, 𝑥, 𝑦 ≥ 0

For Solutions
Download Arvind Academy App
Click Link: http://bit.ly/2kTWbkj

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 6