GYANMANJARI CAREER INSTITUTE,PALANPOR,SURAT

Std 12 : Maths
LINEAR PROGRAMMING Time :
//X Section A
• Choose correct answer from the given options. [Each carries 1 Mark] [19]
1. Solution set of the inequality 2x + y > 5 is .......
(A) The half plane containing origin
(B) The open half plane not containing origin
(C) xy-plane excepts the points on the line 2x + y = 5

E
(D) None of these

UT
2. The optimal value of the objective function is attained at the points .........
(A) given by intersection of inequations with the axes only
(B) given by intersection of inequations with X-axis only

TI T
(C) given by corner points of the feasible region
(D) None of these
3. The region formed by the inequalities x, y > 0, y < 6, x + y < 3 is .........

NS
(A) unbounded in first quadrant (B) unbounded in first and second quadrants
(C) bounded in first quadrant (D) none of these
4.
RI
The corner points of the feasible region are (0, 0), (16, 0), (8, 12), (0, 20). The maximum and
minimum values of Z = 22x + 18y are m and n respectively then m + n = ......
(A) 352 (B) 0 (C) 360 (D) 392
EE
5. The region represented by the inequation x – y < –1, x – y > 0, x > 0, y > 0 is ...........
(A) bounded (B) unbounded (C) do not exist (D) triangular region
AR

6. Let x and y are optimal solution of a LPP, then....

(A) Z = lx + (1 – l)y, l Î R is also an optimal solution
(B) Z = lx + (1 – l)y, 0 < l < 1 gives an optimal solution
IC

(C) Z = lx + (1 + l)y, 0 < l < 1 gives an optimal solution

(D) Z = lx + (1 + l)y, l Î R gives an optimal solution
AR

7. The feasible solution of LPP ..........

(A) satisfy all the constraints (B) satisfy some of the constraints
J

(C) always corner points of feasible solution (D) always optimal value of objective function
AN

8. Consider a LPP given by minimise Z = 6x + 10y.

Subject to x > 6, y > 2, 2x + y > 10, x > 0, y > 0. Redundant constraints in this LPP are .........
(A) x > 6, y > 2 (B) 2x + y > 10, x > 0, y > 0
M

(C) x > 6 (D) x > 6, y > 0

AN

9. Objective function of a LPP is ...........

(A) constant graph (B) a function to be optimized
(C) inequality (D) quadratic equation
GY

10. The maximum value of Z = x + 4y subject to the constraints 3x + 6y < 6, 4x + 8y > 16, x > 0, y > 0 is
..........
(A) 4 (B) 8
(C) unbounded feasible region (D) Does not exist feasible region
11. The corner points of the feasible region determined by some inequality are (0, 10),
(5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0 condition on p and q so that the maximum
of Z occurs at both (15, 15) and (0, 20) is ..........
(A) p = q (B) p = 2q (C) q = 2p (D) q = 3p
12. The shaded region in the given figure is a graph of .........
Y

Wish You - All The Best

 The shaded region in the given figure is a graph of .........
Y

æ 3ö
A ç0, ÷
è 2ø

X' X
æ 3 ö O
B ç - , 0÷
è 4 ø
Y'
(A) 4x – 2y < 3 (B) 4x – 2y < –3 (C) 2x – 4y > 3 (D) 2x – 4y < –3

E
13. The solution of linear programming problem, maximize Z = 3x1 + 5x2 subject to 3x 1 +

UT
2x2 < 18, x1 < 4, x2 < 6, x1 > 0, x2 > 0 is ..........
(A) x1 = 2,x2 = 0,z = 6 (B) x1 = 2,x2 = 6,z = 36 (C) x1 = 4,x2 = 3,z = 27 (D) x1 = 4,x2 = 6,z = 42

TI T
14. The feasible region of the inequality x + y < 1 and x – y < 1 lies in ....... quadrants.
(A) Only I and II (B) Only I and III (C) Only II and III (D) All the these
15. The solution set of the constraints x + 2y < 2000, x + y < 1500, y < 600 and x > 0 does not include

NS
the point ..........
(A) (1000, 0) (B) (0, 500) (C) (2, 0) (D) (2000, 0)
How many points having integer co-ordinates are there in the feasible region of the inequality 3x + 4y £ 12,
16.
x ³ 0 and y ³ 1 ?
RI
(A) 7 (B) 6 (C) 5 (D) 8
EE
17. The vertices of the feasible region determined by some linear constraints are (0, 2), (1, 1),
(3, 3), (1, 5). Let Z = px + qy where p, q > 0. The condition on p and q so that the maximum of
AR

Z occurs at both the points (3, 3) and (1, 5) is .......

(A) p = q (B) p = 2q (C) q = 2p (D) p = 3q
18. For linear programming problem, the objective function is Z = 3x + 2y. If the corner points of the
IC

bounded feasible region are (12, 0), (4, 2), (1, 5) and (0, 10), then the maximum value of Z is ........ .
(A) 46 (B) 36 (C) 13 (D) 56
AR

19. Minimise : Z = 2x + 3y, subject to constraints 2x + 4y £ 12, x + y £ 3, x ³ 0 and y ³ 0.

(A) 9 (B) 0 (C) 12 (D) 6
J
M AN
AN
GY

Wish You - All The Best

 GYANMANJARI CAREER INSTITUTE,PALANPOR,SURAT
Std 12 : Maths
LINEAR PROGRAMMING Time :

Section [ A ] : 1 Mark MCQ

No Ans Chap Sec Que Universal_QueId

1. B Chap 12 [Par... S4 1 QP24P11B1213_P2C12S4Q1
2. C Chap 12 [Par... S4 2 QP24P11B1213_P2C12S4Q2
3. C Chap 12 [Par... S4 3 QP24P11B1213_P2C12S4Q3
4. D Chap 12 [Par... S4 4 QP24P11B1213_P2C12S4Q4
5. C Chap 12 [Par... S4 6 QP24P11B1213_P2C12S4Q6
6. B Chap 12 [Par... S4 7 QP24P11B1213_P2C12S4Q7
7. A Chap 12 [Par... S4 8 QP24P11B1213_P2C12S4Q8
8. B Chap 12 [Par... S4 10 QP24P11B1213_P2C12S4Q10
9. B Chap 12 [Par... S4 11 QP24P11B1213_P2C12S4Q11
10. D Chap 12 [Par... S4 12 QP24P11B1213_P2C12S4Q12
11. D Chap 12 [Par... S4 13 QP24P11B1213_P2C12S4Q13
12. B Chap 12 [Par... S4 17 QP24P11B1213_P2C12S4Q17
13. B Chap 12 [Par... S4 19 QP24P11B1213_P2C12S4Q19
14. D Chap 12 [Par... S4 22 QP24P11B1213_P2C12S4Q22
15. D Chap 12 [Par... S4 26 QP24P11B1213_P2C12S4Q26
16. C Chap 12 [Par... S4 28 QP24P11B1213_P2C12S4Q28
17. A Chap 12 [Par... S4 41 QP24P11B1213_P2C12S4Q41
18. B Chap 12 [Par... S4 59 QP24P11B1213_P2C12S4Q59
19. B Chap 12 [Par... S4 60 QP24P11B1213_P2C12S4Q60

Welcome To Future - Quantum Paper