PRACTICE PAPER (2025-26)
CHAPTER 12 LINEAR PROGRAMMING
SUBJECT: MATHEMATICS MAX. MARKS : 26
CLASS : XII DURATION : 1 hrs
SECTION – A
Questions 1 to 10 carry 1 mark each.
1. Based on the given shaded region as the feasible region in the graph, at which point(s) is the
objective function Z = 3x + 9y maximum?
(a) Point B (b) Point C (c) Point D (d) Every point on the line segment CD
2. In the given graph, the feasible region for a LPP is shaded.
The objective function Z = 2x – 3y will be minimum at:
(a) (4, 10) (b) (6, 8) (c) (0, 8) (d) (6, 5)
3. In a linear programming problem, the constraints on the decision variables x and y are x – 3y ≥ 0, y
≥ 0, 0 ≤ x ≤ 3. The feasible region:
(a) is not in the first quadrant.
(b) is bounded in the first quadrant.
(c) is unbounded in the first quadrant.
(d) does not exist.
4. The optimal value of the objective function is attained at the points
(a) given by intersection of inequation with y-axis only.
(b) given by intersection of inequation with x-axis only.
(c) given by corner points of the feasible region.
(d) none of these
Page - 1 -
5 The feasible region corresponding to the linear constraints of a linear programming problem is
shown in figure.
Which of the following is not a constraint to the given linear programming problem?
(a) x + y ≥ 2 (b) x + 2y ≤ 10 (c) x – y ≥ 1 (d) x – y ≤ 1
6. The solution set of the inequality 3x + 5y < 4 is:
(a) an open half-plane not containing the origin.
(b) an open half-plane containing the origin.
(c) the whole XY-plane not containing the line 3x + 5y = 4.
(d) a closed half plane containing the origin.
7. 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
8. The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0) and
20 4
, . If Z = 30x + 24y is the objective function, then (maximum value of Z – minimum value of
3 3
Z) is equal to:
(a) 40 (b) 96 (c) 136 (d) 144
In the following questions 9 and 10, a statement of assertion (A) is followed by a statement of
reason (R). Mark the correct choice as:
9. Assertion (A): The corner points of the bounded feasible region of a LPP are shown below. The
maximum value of Z = x + 2y occurs at infinite points.
Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner
points.
10. Assertion (A): Maximum value of Z = 3x +2y, subject to the constraints x + 2y ≤ 2; x ≥ 0; y ≥ 0 will
be obtained at point (2, 0).
Reason (R): In a bounded feasible region, it always exist a maximum and minimum value.
Page - 2 -
SECTION – B
Questions 11 to 13 carry 3 marks each
Attempt two of them.
11. Solve the following Linear Programming Problem graphically:
Minimise Z = 13x – 15y subject to the constraints x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0 and y ≥ 0.
12. A manufacturer makes two types of furniture, chairs and tables. Both the products are processed on
three machines A1, A2 and A3. Machine A1 requires 3 hours for a chair and 3 hours for a table,
machine A2 requires 5 hours for a chair and 2 hours for a table and machine A3 requires 2 hours for a
chair and 6 hours for a table. Maximum time available on machine A1, A2 and A3 is 36 hours, 50
hours and 60 hours respectively. Profits are 20 per chair and 30 per table. Formulate the above as
a linear programming problem to maximise the profit.
13. Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to + ≤ 200, ≤ 40, ≥ 20, ≥0
SECTION – D
5 marks each
14. Show that the minimum of Z occurs at more than two points. Minimise and Maximise Z = x +
2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
15. Case-Study : Read the following passage and answer the questions given below.
A firm produces bottles of disinfectant and a bathroom cleaner.
• It can produce maximum of 600 bottles in a day.
• It needs to produce at least 300 bottles everyday.
• It takes 6 hours to produce a bottle of disinfectant and 2 hours for a bottle of bathroom cleaner.
• At least 1200 hours of production time should be used daily.
• Manufacturing cost per bottle of disinfectant is ₹ 50 and ₹ 20 for a bottle of bathroom cleaner.
Based on above answer the following questions:
(i) What is the objective function and constraints for this LPP keeping manufacturing cost as low as
possible? (1)
(ii) Find the number of bottles of disinfectant and bathroom cleaner to be produced per day keeping
total cost of manufacturing the lowest. (2)
(iii) Find the min. cost.
16.
Case-Study 2: Read the following passage and answer the questions given below.
Different activities are taken up daily, for its implementation lots of work and calculations are
required as we work within limitations. A company is planning some manufacturing activity and
based on information available the following data is obtained for some variables x and y related to
manufacturing activity.
Z = 2x + 3y
x ≥ 0, y ≥ 0
x + 2y ≤ 40
2x + y ≤ 50
(i) Find the maximum value of z.
(ii) Find the relation between p and q if the objective function z = px + qy, where p, q > 0 attains
equal values at (3, 4) and (2, 7).
(iii) Check whether the ordered pair (12, 27) lies in the graphical solution of 2x + y ≤ 50.
Page - 3 -
