1

12th Board Booster (2024)

Linear Programming DPP-01

1. Objective function of a L.P.P. is 6. The solution set of the constraint 2 x  y  5 is

(1) A constant
(1) half plane that contains the origin
(2) A function to be optimized
(3) A relation between the variables (2) open half plane not containing the origin and
(4) None of these not containing the points on the line
2x  y  5
2. The feasible region of a linear programming (3) whole XY–plane except the points lying on
problem is bounded. The corresponding objective
the line 2 x  y  5
function is Z = 6x – 7y. The objective function
attains (4) open half plane not containing the origin, but
(1) only minimum containing the points on the line 2x + y = 5
(2) only maximum
(3) both maximum and minimum 7. The objective function Z = ax + by of an LPP has
(4) either maximum or minimum but not both maximum value 42 at (4, 6) and minimum value
19 at (3, 2). Which of the following is true?
3. Which of the following points satisfies both the
constraints, 2 x  y  10 and x  2 y  8? (1) a = 9, b = 1

(1) (– 2, 4) (2) a = 5, b = 2
(2) (3, 2) (3) a = 3, b = 5
(3) (– 5, 6) (4) a = 5, b = 3
(4) (4, 2)

8. The feasible region of a linear programming

4. The corner points of the feasible region in the
graphical representation of a linear programming problem is shown in the figure below:
problem are (2, 72), (15, 20) and (40, 15). If
Z  18x  9 y be the objective function, then
(1) Z is maximum at (2,72), minimum at (15,20)
(2) Z is maximum at (15,20), minimum at
(40,15)
(3) Z is maximum at (40,15), minimum at
(15,20)
(4) Z is maximum at (40,15), minimum at (2,72)

5. The minimum value of Z = 3x + 8y subject to the Which of the following are the possible
constraints x  20, y  10 and x  0, y  0 is constraints?
(1) 80 (1) x  2 y  4, x  y  3, x  0, y  0
(2) 140
(2) x  2 y  4, x  y  3, x  0, y  0
(3) 0
(4) 60 (3) x  2 y  4, x  y  3, x  0, y  0
(4) x  2 y  4, x  y  3, x  0, y  0
 2

9. The feasible region corresponding to the linear 11. Solve the following Linear Programming Problem
constraints of a Linear Programming Problem is graphically:
given below. Maximize: Z = 70x + 40y, subject to the
constraints : 3x + 2y  9, 3x + y  9, x 0, y  0

12. Solve the following linear programming problem

graphically:
Minimize: Z = 5x + 10y, subject to the constraints
: x + 2y  120, x + y  60, x – 2y  0, x  0, y 
0

13. Solve the following linear programming problem

graphically: Maximize Z = 3x + 9y, subject to the
constraints: x  y  10 , x  3 y  60 , x  y ,
x  0, y  0

Which of the following is not a constraint to the 14. Solve the following linear programming problem
given Linear Programming Problem? graphically: Maximize Z = 600x + 400y, subject
to the constraints: x  2 y  12 , 2 x  y  12 ,
(1) x  y  2
x  1.25 y  5 , x  0, y  0
(2) x  2 y  10
(3) x  y  1 15. Solve the following Linear Programming Problem
graphically: Maximize: Z = – x + 2y, subject to the
(4) x  y  1
constraints: x  3, x  y  5, x  2 y  6, y  0.

10. The solution set of the constraint 3x  5 y  7 is

(1) whole XY–plane except the points lying on
the line 3x  5 y  7.
(2) whole XY-plane along with the points lying
on the line 3x  5 y  7 .
(3) open half plane containing the origin except
the points of line 3x  5 y  7.
(4) open half plane not containing the origin
 3

Note: Kindly find the Video Solution of DPPs Questions in the DPPs Section.
Hints & Solutions
1. (2) Corner Points Value of P
O (0, 0) 0
2. (3) B (0, 4.5) 180
C (3, 0) 210 Max Value
3. (4) Maximum value of P = 210 at x = 3 and y = 0

4. (3) 12.

5. (1)

6. (4)

7. (3)

8. (3)

9. (3)
We observe, (0, 0) does not satisfy the inequality Corner Points Value of Z
x  y 1 A (40, 20) 400
So, the half plane represented by the above B (60, 30) 600
inequality will not contain origin therefore, it will C (120, 0) 600
not contain the shaded feasible region. D (60, 0) 300 (Min)
Min. Z = 300 at x = 60; y = 0
10. (3)
13.
11.

Corner Points Value of Z = 3x + 9y

A (0, 20) 180  Maximum
B (0, 10) 90
C (5, 5) 60
D (15, 15) 180Maximum
Maximum lies at every point on the line segment
AD.
 4

14. The feasible region determined by the constraints, 15. The feasible region determined by the constraints,
x  2 y  12 , 2 x  y  12 , x  1.25 y  5 , x  3, x  y  5, x  2 y  6, y  0 is given below.
x  0, y  0

Here, it can be seen that the feasible region is

unbounded.
The value of Z at corner points A(3, 2), B(4, 1) and
C(6, 0) are given below.
Corner Points Value of Z = 600x + 400y Corner Corresponding value of Z = – x + 2y
A (5, 0) 3000 A(3, 2) 1 (may or may not be the maximum
B (6, 0) 3600 value)
C (4, 4) 4000Maximum B(4, 1) –2
D (0, 6) 2400 C(6, 0) –6
E (0, 4) 1600
Since the feasible region is unbounded, Z = 1 may
Max. Z = 4000 at x = 4; y = 4
or may not be the maximum value.
Now, we draw the graph of the inequality,
– x + 2y > 1, and we check whether the resulting
open half–plane has any point/s, in common with
the feasible region or not.
Here, the resulting open half plane has points in
common with the feasible region.
Hence, Z = 1 is not the maximum value. We
conclude, Z has no maximum value.

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if