M - 12

CH. LINEAR PROGRAMMING

CLASS XII MATHEMATICS Time : 1½ hrs

Marks : 40
SET A

SECTION - A 10 × 1 = 10

1. Solution set of the inequality 2x + y > 5 is

a) Half plane containing origin

b) Half plane not containing origin

c) xy-plane except the points on the line 2x + y = 5 d) No solution

2. In an LPP, if the objective function Z = ax + by has same maximum at two corner points of
the feasible region, then the number of points at which maximum value of Z occurs is

a) 0 b) 1 c) 2 d) infinite

3. A linear programming problem is as follows:

Minimize Z = 2x + y subject to constraints x  3, x  9, y  0, x  y  0, x  y  14

The feasible region has

a) 5 corner points including (0, 0) and (9, 5)

b) 5 corner points including (7, 7) and (3, 3)

c) 5 corner points including (14, 0) and (9, 0)

d) 5 corner points including (3, 6) and (9, 5)

4. The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0)

and  20 3 , 4 3  . If Z = 30x + 20y is the objective function, then (Maximum value of

Z – Minimum value of Z) is equal to

a) 40 b) 96 c) 160 d) 136

5. The position of points O(0, 0) and P(2, –1) is ........., in the solution region of the inequality
2y – 3x < 5.

a) O is inside the region and P is outside the region

b) O and P both are inside the region c) O and P both are outside the region

d) O is outside and P is inside the region

6. The feasible region of constraints x  y  4, 3 x  3 y  18, x  0, y  0 defines on ..........

a) bounded feasible region b) unbounded feasible region

c) feasible region in first and second quadrants d) does not exist
1
7. The shaded region in the given figure is the graph of ........

a) 4x  2 y  3

b) 4x  2 y   3

c) 2x  4 y  3

d) 2x  4 y   3

8. The corner points of the bounded feasible region determined by a system of linear
constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. The condition on p
and q so that the minimum of Z occurs at (3, 0) and (1, 1) is

q
a) p = 2q b) p c) p = 3q d) p = q
2
For question number 9 -10 two statements are given - one labelled Assertion (A)
and the other labelled Reason (R). Select the correct answer to these questions
from the codes (a), (b), (c) and (d) as given below.

a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation
of Assertion (A).
b) Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct
explanation of Assertion (A).
c) Assertion (A) is true but Reason (R) is false.
d) Assertion (A) is false but Reason (R) is true.

9. Assertion (A) : The feasible region represented by 2x + 5y  80, x + y  20, x  0,

y  0 is bounded

Reason (R) : A region is said to be convex if the line joining any two of its points lies
completely in the region.

10. Assertion (A) : The maximum value of Z = 11x + 7y subjected to 2x + y  6, x  2,

x, y  0, occurs at (0, 6).

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

SECTION - B 2×2=4
11. Minimise Z = 13x – 15y subject to the constraints x + y  7, 2x – 3y + 6  0, x  0, y  0.

12. Maximise Z = 100x + 120y subject to the constraints 5x + 8y  200, 5x + 4y  120,

x, y  0

OR

Find Zmax = 3x + 2y subject to the constraints x + y  2, x, y  0.

2 M-Ch-(Linear Programm) A
 SECTION - C 4 × 3 = 12

13. Maximise : Z = 3x + 9y subject to x + y  10, x + 3y  60, x  y, x, y  0.

14. Solve the following L.P.P. graphically:

Maximize Z = 20x + 10y

Subject to the following constraints :

x + 2y  28,

3x + y  24,

x  2

x, y  0

15. Maximize Z = x + 2y

subject to the constraints

x + 2y  100, 2x – y  0

2x + y  200, x, y  0

Solve the above LPP graphically.

16. Make a graphical representation of the set of constraints in the following LPP:

Maximize z = 4x1 + 3x2

subject to : x1 + x2  50

x1 + 2x2  80

2x1 + x2  20

x 1, x 2  0

Find the extreme point of the feasible region. Hence, find the maximum value of the objective
function.

OR

Find the maximum value of Z = 7x + 7y, subject to the constraints: x  0, y  0, x + y  2

and 2x + 3y  6.
SECTION - D 2 × 5 = 10

17. Maximise : Z = 70x + 40y subject to 3x + 2y  9, 3x + y  9, x, y  0

OR

Maximise : Z = 60x + 40y subject to 5x + 6y  45, 3x + 2y  18, x, y  0

3 M-Ch-(Linear Programm) A
18. Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:

2x + 4y  8

3x + y  6

x + y  4

x  0, y  0
SECTION - E
Case Study Based Questions 4×1=4

19. Read the following passage and answer the questions

A dealer Ram Singh residing in a rural area opens a shop to start his business with an
investment of Rs. 5760. He wishes to purchase ceiling fans and table fans. A ceiling fan
costs him Rs. 360 and table fan costs Rs. 240.

Based on the above information answer the following questions.

i) Ram Singh purchases x ceiling fans and y table fans. He has space in his store for at
most 20 items. Write its constraint.

ii) If he sells ceiling fan at a profit of Rs. 22 and table fan for a profit of Rs. 18, then
express the profit Z in terms of x and y.

iii) What is the maximum profit of selling all the fans?

4 M-Ch-(Linear Programm) A
M - 12
CH. LINEAR PROGRAMMING

CLASS XII MATHEMATICS Time : 1½ hrs

Marks : 40
SET B

SECTION - A 10 × 1 = 10

1. The maximum value of Z = 3x + 4y subject to constraints x + y  4, x  0, y  0 is

a) 16 b) 12 c) 0 d) not possible

2. Which of the following statement is correct?

a) Every L.P.P. admits an optimal solution

b) An L.P.P. admits a unique optimal solution

c) If an L.P.P. admits two optimal solutions, it has an infinite number of optimal solutions

d) The set of all feasible solutions of a L.P.P. is not a convex set.

3. Under the constraints x – 2y  6, x + 2y  0, x  6, the maximum value of Z = 3x + 4y

is

a) 16 b) 17 c) 18 d) 19

4. If the corner points of the feasible region of an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and
(0, 5), then the minimum value of the objective function Z = 4x + 6y occurs at

a) (0, 2) only b) (3, 0) only

c) The midpoint of the line segment joining the points (0, 2) and (3, 0) only

d) Every point on the line segment joining the points (0, 2) and (3, 0)

5. 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

6. A linear programming problem is as follows :

Maximize / minimize objective function Z = 2x – y + 5 subject to constraints 3x + 4y  60,

x + 3y  30, x  0, y  0.

If the corner points of the feasible region are A(0, 10), B(12, 6), C(20, 0) and O(0, 0), then
which of the following are true?

a) Maximum value of Z is 40 b) Minimum value of Z is –5

c) Difference between maximum and minimum values of Z is 35

d) At two corner points the values of Z are equal

5
7. The corner points of the feasible region determined by a 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 occurs
at both (2, 4) and (4, 0), then

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

8. Objective function of a LPP is

a) Constant graph b) A function to be optimized

c) Inequality d) Quadratic function

For question number 9 -10 two statements are given - one labelled Assertion (A)
and the other labelled Reason (R). Select the correct answer to these questions
from the codes (a), (b), (c) and (d) as given below.

a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation
of Assertion (A).
b) Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct
explanation of Assertion (A).
c) Assertion (A) is true but Reason (R) is false.
d) Assertion (A) is false but Reason (R) is true.

9. Assertion (A) : The point (4, 2) does not lies in the half plane 4x + 6y – 24 < 0.

Reason (R) : The point (1, 2) lies in the half plane 4x + 6y – 24 < 0.

10. Assertion (A) : If the corner points of the feasible region for an LPP are (0, 4), (1, 4),
(4, 1) and (12, –1), then the minimum value of the objective function
Z = 2x + 4y is at (4, 1).

Reason (R) : If the corner points of the feasible region for an LPP are (0, 4), (1, 4)
(4, 1) and (12, –1), then the maximum value of the objective function
Z = 2x + 4y is 20.
SECTION - B 2×2=4
11. Feasible region for an LPP is shown in the figure. Maximize Z = 5x + 7y.

OR

Find max, value of Z = 3x + 4y subject to the constraints x + y  1, x, y  0.

6 M-Ch-(Linear Programm) B
12. Maximise the function Z = 9x + 11y, subject to x  3, y  2, x, y  0.
SECTION - C 4 × 3 = 12
13. Maximize Z = 10x + 6y, subject to the constraints are : 3x + y  12, 2x + 5y  34 and
x, y  0

14. Solve the following L.P.P. graphically :

Minimize Z = 5x + 10y

Subject to x + 2y  120

Constraints x + y  60

x – 2y  0

and x, y  0

15. Solve the following L.P.P. graphically :

Maximize Z = 4x + y

Subject to following constraints

x + y  50,

3x + y  90,

x  10

x, y  0

16. Maximise Z = 5x + 10y subject to x + 2y  120, x + y  60, x –2y  0, x, y  0

OR
Maximise : Z = 300x + 190y subject to x + y  24, x + ½y  16, x, y  0

SECTION - D 2 × 5 = 10
17. Minimize : Z = 5x + 7y subject to 2x + y  8, x + 2y  10, x, y  0

18. Solve the following linear programming problem graphically :

Maximize Z = 7x + 10y

Subject to the constraints

4x + 6y  240
6x + 3y  240
x  10
x  0, y  0
OR

7 M-Ch-(Linear Programm) B
 Solve the following linear programming problem graphically :
Maximise Z = 34x + 45y
under the following constraints
x + y  300
2x + 3y  70

x  0, y  0

SECTION - E

Case Study Based Questions 4×1=4

19. Read the following passage and answer the questions

The students of class XII are asked to write linear inequalities in two variables.

They have written : 3x + 5y  15, 5x + 2y  10, x  0 and y  0.

Based on the above information answer the following questions.

i) Draw the feasible region of above system of inequalities.

ii) Find the corner points of the solution region.

8 M-Ch-(Linear Programm) B