HOTS QUESTIONS

XII CBSE BOARD EXAMINATION CHAPTER 12: LINEAR

PRACTICE WORKSHEET
PROGRAMMING

MUTILPLE CHOICE QUESTIONS

1. The solution set of the inequality 3𝑥 + 5𝑦 < 4 is

(a) an open half-plane not containing the origin
(b) an open half-plane containing the origin
(c) the whole 𝑥𝑦-plane not containing the line 3𝑥 + 5𝑦 = 4
(d) a closed half-plane containing the origin.
2. The corner points of the feasible region determined by the system of linear constraints are, (0, 10), (5,
5), (15, 15), (0, 20). Let 𝑧 = 𝑝𝑥 + 𝑞𝑦, where 𝑝, 𝑞 > 0. Condition on 𝑝 and 𝑞 so that the maximum of 𝑧
occurs at both the points (15, 15) and (0, 20) is
(a) 𝑝 = 𝑞 (b) 𝑝 = 2𝑞 (c) 𝑞 = 2𝑝 (d) 𝑞 = 3𝑝
4. Corner points of the feasible region for an LPP are: (0, 2), (3, 0), (6, 0), (6, 8) and (0,5). Let 𝑧 = 4𝑥 + 6𝑦
the objective function. The minimum value of 𝑧 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)
5. Corner points of the feasible region for an LPP are: (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let 𝑧 = 4𝑥 + 6𝑦
be the objective function. Then, 𝑀𝑎𝑥. 𝑧 − 𝑀𝑖𝑛. 𝑧 =
(a) 60 (b) 48 (c) 42 (d) 18
7. The solution set of the inequality 2𝑥 + 𝑦 > 5 is
(a) half plane that contains the origin
(b) open half plane not containing the origin
(c) whole 𝑥𝑦-plane except the points lying on the line 2𝑥 + 𝑦 = 5
(d) none of these
8. 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
9. Which of the following sets are convex
(a) {(𝑥, 𝑦): 𝑥 2 + 𝑦 2 ≥ 1} (b) {(𝑥, 𝑦): 𝑦 2 ≥ 𝑥}
(c) {(𝑥, 𝑦): 3𝑥 2 + 4𝑦 2 ≥ 5} (d) {(𝑥, 𝑦): 𝑦 ≥ 2, 𝑦 ≤ 4}
10. The optimal value of the objective function is attained at the points
(a) given by intersection of inequalities with the axes only
(b) given by intersection of inequalities with x-axis only
(c) given by corner points of the feasible region
(d) none of these
11. Consider a LPP given by Minimum 𝑍 = 6𝑥 + 10𝑦, Subjected to 𝑥 ≥ 6; 𝑦 ≥ 2; 2𝑥 + 𝑦 ≥ 10; 𝑥, 𝑦 ≥ 0.
The redundant constraints in this LPP are
(a) 𝑥 ≥ 0, 𝑦 ≥ 0 (b) 𝑥 ≥ 6, 2𝑥 + 𝑦 ≥ 10
(c) 2𝑥 + 𝑦 ≥ 10 (d) none of these
12. 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
13. 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
15. The region represented by the inequalities 𝑥, 𝑦 ≥ 0, 𝑦 ≤ 6, 𝑥 + 𝑦 < 3 is
(a) unbounded in first quadrant (b) unbounded in first and second quadrants
(c) bounded in first quadrant (d) none of these
19. Minimize 𝑧 = ∑𝑛𝑗=1 ∑𝑚 𝑛
𝑖=1 𝑐𝑖𝑗 𝑥𝑖𝑗 Subject to, ∑𝑗=1 𝑥𝑖𝑗 ≤ 𝑎𝑖 ; 𝑖 = 1,2, … , 𝑚

∑𝑚
𝑖=1 𝑥𝑖𝑗 = 𝑏𝑖 ; 𝑗 = 1,2, … , 𝑛 is an LPP with number of constraints
𝑚
(a) 𝑚 + 𝑛 (b) 𝑚 − 𝑛 (c) 𝑚𝑛 (d) 𝑛

20. The number of corner points of the feasible region determined by the constraints 𝑥 − 𝑦 ≥ 0, 2𝑦 ≤ 𝑥 +
2, 𝑥 ≥ 0, 𝑦 ≥ 0 is:
(a) 2 (b) 3 (c) 4 (d) 5
21. The objective function 𝑍 = a𝑥 + 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
22. The number of feasible solutions of the linear programming problem given as
Maximize z = 15x + 30y subject to constraints :
3𝑥 + 𝑦 ≤ 12, 𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0 is
(a) 1 (b) 2 (c) 3 (d) infinite
23. The feasible region of a linear programming problem is shown in the figure below :
 Which of the following are the possible constraints?
(a) x + 2y ≥ 4, 𝑥 + 𝑦 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0 (b) 𝑥 + 2𝑦 ≤ 4, 𝑥 + 𝑦 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0
(c) 𝑥 + 2𝑦 ≥ 4, 𝑥 + 𝑦 ≥ 3, 𝑥 ≥ 0, ∣ 𝑦 ≥ 0 (d) 𝑥 + 2𝑦 ≥ 4, 𝑥 + 𝑦 ≥ 3, 𝑥 ≤ 0, 𝑦 ≤ 0
24. The feasible region corresponding to the linear constraints of a Linear Programming Problem is given
below.

Which of the following is not a constraint to the given Linear Programming Problem?
(a) 𝑥 + 𝑦 ≥ 2 (b) 𝑥 + 2𝑦 ≤ 10 (c) 𝑥 − 𝑦 ≥ 1 (d) 𝑥 − 𝑦 ≤ 1
25. The point which lies in the half-plane 2𝑥 − 4𝑦 > 0 is:
(a) (8, 0) (b) (1, 1) (c) (5, 5) (d) (2, 2)
26. A linear programming problem deals with the optimization of a/an :
(a) logarithmic function (b) linear function
(c) quadratic function (d) exponential function
27. The common region determined by all the constraints of a linear programming problem is called :
(a) an unbounded region (b) an optimal region
(c) a bounded region (d) a feasible region
28. The restrictions imposed on decision variables involved in an objective function of a linear
programming problem are called :
(a) feasible solutions (b) constraints (c) optimal solutions (d) infeasible solutions
29. A linear programming problem (LPP) along with the graph of its constraints is shown below.
The corresponding objective function is: 𝑍 = 18𝑥 + 10𝑦, which has to be minimized. The smallest
value of the objective function Z is 134 and is obtained at the corner point (3,8),
 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 18𝑥 + 10𝑦 < 134 does not have any point in common with the
feasible region.
(c) exists as the inequality 18𝑥 + 10𝑦 > 134 has infinitely many points in common with the feasible
region.
(d) exists as the inequality 18𝑥 + 10𝑦 < 134 does not have any point in common with the feasible
region.

SHORT ANSWER QUESTIONS

Solve the following Linear Programming Problems graphically:

30. Minimise/Maximise 𝑍 = 3𝑥 + 9𝑦
Subject to the constraints: 𝑥 + 3𝑦 ≤ 60, 𝑥 + 𝑦 ≥ 10, 𝑥 ≤ 𝑦, 𝑥 ≥ 0, 𝑦 ≥ 0
31. Minimum 𝑍 = −50𝑥 + 20𝑦
Subject to the constraints: 2𝑥 − 𝑦 ≥ −5, 3𝑥 + 𝑦 ≥ 3, 2𝑥 − 3𝑦 ≤ 12, 𝑥 ≥ 0, 𝑦 ≥ 0
32. Minimise 𝑍 = 3𝑥 + 2𝑦
Subject to the constraints: 𝑥 + 𝑦 ≥ 8, 3𝑥 + 5𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0

33. Minimise/Maximise 𝑍 = 5𝑥 + 10 𝑦

Subject to the constraints: 𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 – 2𝑦 ≥ 0, 𝑥, 𝑦 ≥ 0

34. Maximise 𝑍 = 5𝑥 + 3𝑦
Subject to the constraints: 3𝑥 + 5𝑦 ≤ 15, 5𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0
35. Minimise 𝑍 = 3𝑥 + 5𝑦
Subject to the constraints: 𝑥 + 3𝑦 ≥ 3, 𝑥 + 𝑦 ≥ 2, 𝑥 ≥ 0, 𝑦 ≥ 0

36. Minimise 𝑍 = 𝑥 + 2𝑦

Subject to the constraints: 2𝑥 + 𝑦 ≥ 3, 𝑥 + 2𝑦 ≥ 6, 𝑥 ≥ 0, 𝑦 ≥ 0

37. Minimise/Maximise 𝑍 = 𝑥 + 2𝑦
 Subject to the constraints: 𝑥 + 2𝑦 ≥ 100, 2𝑥 – 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200; 𝑥 ≥ 0, 𝑦 ≥ 0.
38. The corner points of the feasible region determined by the system of linear constraints are as shown
in the following figure :

(i) If Z = 3𝑥 − 4𝑦 be the objective function, then find the maximum value of 𝑍.

(ii) If 𝑍 = 𝑝𝑥 + 𝑞𝑦 where 𝑝, 𝑞 > 0 be the objective function. Find the condition on 𝑝 and 𝑞 so that
maximum value of 𝑍 occurs at 𝐵(4,10) and C(6,8).

CASE STUDY QUESTIONS

39. The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a
healthy and well-balanced diet is crucial in order to supply the body with the proper nutrients it needs.
A balanced diet also keeps us mentally fit and promotes improved level of energy.

A dietician wishes to minimize the cost of a diet involving two types of foods, food X (x kg) and food
Y (y kg) which are available at the rate of ₹ 16/kg and ₹ 20/kg respectively. The feasible region
satisfying the constraints is shown in Figure-2.
On the basis of the above information, answer the following questions :
(i) Identify and write all the constraints which determine the given feasible region in Figure-2.
(ii) If the objective is to minimize cost 𝑍 = 16𝑥 + 20𝑦, find the values of 𝑥 and 𝑦 at which cost is
minimum. Also, find minimum cost assuming that minimum cost is possible for the given unbounded
region.
ANSWER KEY
 MULTIPLE CHOICE QUESTIONS
1(b) 2(d) 4(d) 5(a) 7(b) 8(b) 9(d) 10(c) 11(c) 12(a) 13(c) 15(c) 19(a) 20(b) 21(c)
22(d) 23(c) 24(c) 25(a) 26(b) 27(d) 28(b) 29(d)
SHORT ANSWER QUESTIONS
30) Minimum 𝑍 = 60 at (5,5)
Maximum 𝑍 = 180 at (15,15) and (0,20), hence infinite solutions at all points on the line containing (15,15) and (0,20)
31) 𝑍 has no minimum value 32) No feasible solution: [non convex polygon)]
33) Minimum 𝑍 = 300 at (60,0)
Maximum 𝑍 = 600 at (120,0) and (60,30), hence infinite solutions at all points on the line containing (120,0) and (60,30)
235 20 45 3 1
34) 𝑍 = at ( , ) 35) 𝑍 = 7 at ( , )
19 19 19 2 2
36) 𝑍 = 6; at all infinite points on the line joining (6,0) and (0,3)
37) minimum 𝑍 = 100; at all infinite points joining (0,50) and (20,40); maximum 𝑍 = 400; at (0,200)
38) (i) 12 (ii) 𝑝 = 𝑞
CASE STUDY QUESTIONS
39) (i) 3𝑥 + 𝑦 ≥ 8, 𝑥 + 𝑦 ≥ 6, 𝑥 + 2𝑦 ≥ 10 (ii) minimum 𝑍 = 112 at (2,4)