0% found this document useful (0 votes)
45 views

UT - 1 Maths

This document contains a 40 question multiple choice math exam on linear programming problems (LPP). The exam covers key concepts in LPP including feasible regions, corner points, redundant constraints, optimal solutions, and graphing linear inequalities. Students are asked to identify optimal values, corner points, redundant constraints, the type of feasible region defined by given constraints, and the number of points satisfying given inequalities.

Uploaded by

dhairyashah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views

UT - 1 Maths

This document contains a 40 question multiple choice math exam on linear programming problems (LPP). The exam covers key concepts in LPP including feasible regions, corner points, redundant constraints, optimal solutions, and graphing linear inequalities. Students are asked to identify optimal values, corner points, redundant constraints, the type of feasible region defined by given constraints, and the number of points satisfying given inequalities.

Uploaded by

dhairyashah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KRISHNA INTERNATIONAL SCHOOL

Total Time : 1 Hour


Total Marks : 40
12th CBSE/EM
Question Paper
Maths-9 Objective
Date: 07-09-2021
A
//X
• Choose correct answer from the given options. [Each carries 1 Mark] [40]
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
(D) None of these
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
(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 .........
(A) unbounded in first quadrant (B) unbounded in first and second quadrants
(C) bounded in first quadrant (D) none of these
4. 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
5. For linear programming x + 2y > 10, 3x + 4y < 24 and x > 0, y > 0 .......... is not the corner point
of feasible region.
(A) (0, 6) (B) (4, 3) (C) (3, 4) (D) (0, 5)
6. 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
7. 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
(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
8. The feasible solution of LPP ..........
(A) satisfy all the constraints (B) satisfy some of the constraints
(C) always corner points of feasible solution (D) always optimal value of objective function
9. Which of the following statement is correct ?
(A) Every LPP admits an optimal solution
(B) A LPP admits an optimal solution
(C) If a LPP admits two optimal solutions it has an infinite number of optimal solution.
(D) The set of all feasible solutions of a LPP is not a converse set.
10. 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
(C) x > 6 (D) x > 6, y > 0
11. Objective function of a LPP is ...........
(A) constant graph (B) a function to be optimized
(C) inequality (D) quadratic equation
12. 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
y > 0 is ..........
(A) 4 (B) 8
(C) unbounded feasible region (D) Does not exist feasible region
13. 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
14. 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
15. The corner points of the feasible region are A(3, 3), B(20, 3), C(20, 10), D(18, 12) and E(12, 12).
The maximum value of Z = 2x + 3y is ..........
(A) 72 (B) 80 (C) 82 (D) 70
16. Cake-A requires 200 g of flour and 25 g of fat. Cake-B requires 100 g of flour and 50 g of fat. Find
the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat. The
mathematical form of this LPP is .........
(A) Z = x + y, 2x + y < 50, x + 2y < 40, x > 0, y > 0
(B) Z = x + y, 2x + y < 5, x + 2y < 1, x > 0, y > 0
(C) Z = x + y, 200x + 100y < 5, 25x + 50y < 1,x > 0, y > 0
(D) Z = x + y, 200x + 100y > 5, 25x + 50y > 1,x > 0, y > 0
17. The shaded region in the given figure is a graph of .........
(A) 4x – 2y < 3 Y
(B) 4x – 2y < –3
(C) 2x – 4y > 3
(D) 2x – 4y < –3
æ 3ö
A ç0, ÷
è 2ø

X' X
æ 3 ö O
B ç - , 0÷
è 4 ø
Y'
18. The point at which the maximum value of Z = 3x + 2y subject to the constraints x + 2y < 2, x
> 0, y > 0 is ..........
(A) (0, 0) (B) (1.5, – 1.5) (C) (2, 0) (D) (0, 2)
19. The solution of linear programming problem, maximize Z = 3x1 + 5x2 subject to 3x1 + 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
20. The maximum value of Z = x + 3y subject to the constraints 2x + y < 20, x + 2y < 20, x > 0, y
> 0 is ..........
(A) 10 (B) 60 (C) 40 (D) 30
21. The solution set of the constraints x + 2y > 11, 3x + 4y < 30, 2x + 5y < 30, x > 0, y >0 includes
the point.
(A) (2, 3) (B) (3, 2) (C) (3, 4) (D) (4, 3)
22. 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 four
23. The following five inequalities form the feasible region. 2x – y < 8, x + y < 20, –x + y > –10, x >
0, y > 0. Redundant constraints is .....
(A) x > 0 (B) 2x – y < 8 (C) –x + y > –10 (D) x + y < 20
24. The position of the points O(0, 0) and P(2, –1) is ........, in the 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
The position of the points O(0, 0) and P(2, –1) is ........, in the 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 the region and P is inside the region
25. The constraints x + y < 4, 3x + 3y > 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
26. The solution set of the constraints x + 2y < 2000, x + y < 1500, y < 600 and x > 0 does not include
the point ..........
(A) (1000, 0) (B) (0, 500) (C) (2, 0) (D) (2000, 0)
27. Out of the following points, how many points are satisfied the inequality 2x – 3y > – 5 ? (1, 1) (–1, 1),
(1, –1), (–1, –1), (–2, 1) (2, –1), (–1, 2) and (–2, –1)
(A) 3 (B) 5 (C) 6 (D) 4
28. How many points having integer co-ordinates are there in the feasible region of the inequality
3x + 4y £ 12, x ³ 0 and y ³ 1 ?
(A) 7 (B) 6 (C) 5 (D) 8
29. z = 30x – 30y + 1800 is a objective function. The corner points of the feasible region are (15, 0),
(15, 15), (10, 20), (0, 20) and (0, 15). z has the minimum value at .......... point.
(A) (0, 20) (B) (0, 15) (C) (15, 0) (D) (10, 20)
30. The corner points of the bounded feasible region are (0, 1), (0, 7), (2, 7), (6, 3) (6, 0) (1, 0).
For the objective function Z = 3x – y ..........
(i) At which point, Z is minimum ?
(ii) At which point, Z is maximum ?
(iii) The maximum value of Z is .........
(iv) The minimum value of Z is .........
(A) (i) (2, 7) (ii) (6, 3) (iii) 20 (iv) –1 (B) (i) (0, 7) (ii) (6, 0) (iii) 18 (iv) –7
(C) (i) (0, 1) (ii) (6, 3) (iii) 18 (iv) –1 (D) (i) (0, 7) (ii) (6, 0) (iii) 15 (iv) –7
31. The constraints –x + y £ 1, –x + 3y £ 9, x ³ 0, y ³ 0 defines on ..........
(A) bounded feasible space (B) unbounded feasible space
(C) Does not get feasible space (D) Feasible space is a square
32. The solution set of the constraints 2x + 3y £ 6, 5x + 3y £ 15 and x ³ 0, y ³ 0 does not include
.......... point.
(A) (0, 2) (B) (0, 0) (C) (3, 0) (D) (0, 5)
33. The solution set of the constraints 2x + 3y £ 6, x + 4y £ 4 and x ³ 0, y ³ 0 includes the point
.......... as corner point.
æ 12 2 ö æ 2 12 ö
(A) (1, 0) (B) (1, 1) (C) è 5 , 5 ø (D) è 5 , 5 ø

34. The region formed by the inequalities 2x + 3y – 5 £ 0, 4x – 3y + 2 £ 0 and x ³ 0 .........


(A) does not lie in first quadrant (B) lies in first quadrant and bounded
(C) lies in first quadrant and unbounded (D) lies in first and second quadrant
35. A wholesale dealer wants to starts the business with 2,40,000. The cost price of a quintal wheat
is 2000 and the cost price of a quintal rice is 3000. He has the space capacity for 200
quintals grain. The profit from the sale of one quintal wheat is 125 and that from one quintal
rice is 200. If he has x quintal rice and y quintal wheat then the objective function for the
maximum profit is ..........
2000 3000
(A) 125x + 200y (B) 200x + 125y (C) 2000x + 3000y (D) x+ y
200 125
æ 10 ö
36. The corner points of the bounded feasible region are (0, 0), (2, 0), (4, 2), (2, 4) and çè 0, 3 ÷ø .
Then for the objective function z = –x + 2y,
(i) Maximum value of z has at ..........
(ii) Minimum value of z has at ..........
(iii) The maximum value of z is ..........
Then for the objective function z = –x + 2y,
(i) Maximum value of z has at ..........
(ii) Minimum value of z has at ..........
(iii) The maximum value of z is ..........
(iv) The minimum value of z is ..........

æ 10 ö
(A) (i) (2, 4)(ii) (0, 0)(iii) 6(iv) 0 (B) (i) çè 0, ÷ø (ii) (4, 2)(iii) 6(iv) 0
3

æ 10 ö 20
(C) (i) (2, 4)(ii) (2, 0)(iii) 6(iv) –2 (D) (i) çè 0, ÷ø (ii) (2, 0)(iii) (iv) –2
3 3
37. The production of item A is x and the production of item B is y. If the corner points of the
bounded feasible region are (1, 0), (2, 0), (0, 2) and (0, 1) then the maximum profit z = 2000x +
5000y is ........
(A) 20,000 (B) 5,000 (C) 4,000 (D) 10,000
38. The corner points of the bounded feasible region are (60, 0), (120, 0), (60, 40), (40, 20) and (20,
30). For the objective function z = 5x + 10y ..........
(i) Maximum value of z.
(ii) Minimum value of z.
(iii) Maximum value of z has at ...........
(iv) Minimum value of z has at ...........
(A) 700, 600, (60, 40), (120, 0) (B) 600, 400, (120, 0), (40, 20)
(C) 600, 300, (120, 0), (60, 0) (D) 700, 300, (60, 40), (60, 0)
39. The minimum value of z = 2x + 4y subject to constraints x + 2y ³ 10, 3x + y ³ 10, x ³ 0, y ³ 0 is ..........
(A) 20 (B) 40 (C) Not exists (D) 30
40. The objective function of a linear programming problem is ...........
(A) a function to be optimized. (B) a quadratic equation.
(C) a constant. (D) an inequality.

You might also like