0% found this document useful (0 votes)
26 views4 pages

Class 12 Maths Assignemnt

mlmlmllml

Uploaded by

Anirudh Ramkumar
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)
26 views4 pages

Class 12 Maths Assignemnt

mlmlmllml

Uploaded by

Anirudh Ramkumar
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

D.A.

V SCHOOL, PALLIKARANAI
WORKSHEET - 1
CLASS: XII SUBJECT: MATHEMATICS
LINEAR PROGRAMMING PROBLEMS
1. The point which doesn’t lie in the half plane 2x + 3y - 12 ≤ 0 is
(a) (1, 2) (b) (2, 1) (c) (2,3) (d) (– 3, 2)
2. A decorative items dealer deals in two items A and B. He has ₹15,000 to invest and a space to store
at the most 80 pieces. One piece of item A costs ₹ 300 and that of item B cost ₹150. He can sale a
piece of item A and B at profits of ₹50 and ₹28. Assuming he can sale all he buys, then the objective
function Z for maximising the profit is ___________
(a) 50𝑥 + 28𝑦 (b) 28𝑥 + 50𝑦 (c) 300𝑥 + 150𝑦 (d) 150𝑥 + 300𝑦
3. The feasible region for a LPP is shown in the figure. Maximum of 𝑍 = 2𝑥 + 4𝑦 occurs at the point

4. The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0)
as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at

(a) (0.6,1.6) only (b) (3, 0) only (c) (0.6, 1.6) and (3, 0) only
(d) at every point of the line-segment joining the points (0.6, 1.6) and (3, 0)
5. 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.
6. Solve the linear inequation −3𝑥 + 2𝑦 ≥ 6 graphically.

Solve the following Linear Programming Problem graphically:

7. Maximize 𝑍 = 400𝑥 + 300𝑦, Subject to 𝑥 + 𝑦 ≤ 200, 𝑥 ≤ 40 , 𝑥 ≥ 20 , 𝑦 ≥ 0


8. Maximize: 𝑍 = −𝑥 + 2𝑦 , Subject to 𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0
9. Minimize: 𝑍 = 𝑥 + 2𝑦, Subject to 2𝑥 + 𝑦 ≥ 3, 𝑥 + 2𝑦 ≥ 6, 𝑥, 𝑦 ≥ 0
10. Minimize: 𝑍 = 13𝑥 − 15𝑦, Subject to 𝑥 + 𝑦 ≤ 7, 2𝑥 − 3𝑦 + 6 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0

RELATIONS AND FUNCTIONS

1. R be the relation defined on the set N as 𝑅 = {(𝑥, 𝑦): 𝑥 + 𝑦 = 10, 𝑥, 𝑦𝜖𝑁 }.


Determine whether R is reflexive, symmetric or transitive.
2. Let 𝐴 = {1,2,3}. Find the number of equivalence relations on A containing
(1,2).
3. Write the ordered pairs to be added to 𝑅 = {(1,1), (2,2), (3,3), (1,3)}
defined on
𝐴 = {1,2,3} to make it the smallest equivalence relation.
4. Determine whether the relation R defined on the set of all real numbers as
𝑅 = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝑅 𝑎𝑛𝑑 𝑎 − 𝑏 + √2 ∈ 𝑆, 𝑤ℎ𝑒𝑟𝑒 𝑆 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑎𝑙𝑙 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟𝑠},
Is reflexive, symmetric and transitive.
5. Show that the given relation R is defined on the set 𝐴 = {𝑥 𝜖 𝑍 ∶ 0 ≤ 𝑥 ≤
12}, given by
𝑅 = {(𝑎, 𝑏): 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4}, is an equivalence relation. Write the set
of all elements related to 1.
6. Show that the relation R defined by (𝑎, 𝑏)𝑅 (𝑐, 𝑑) ⇒ 𝑎 + 𝑑 = 𝑏 + 𝑐 on
𝐴 × 𝐴,
Where 𝐴 = {1,2,3, … .10} is an equivalence relation. Hence write the
equivalence classes [(1,3)] and [(3,4)] ; 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝐴
7. Show that the relation R in the set 𝐴 = {1,2,3,4,5}, given by
𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 2} is an equivalence relation. Show
that all the elements of {1,3,5} are related to each other and all the
elements of {2,4} are related to each other, but no element of {1,3,5} is
related to any element of {2,4}.
8. Let R be the relation on 𝑁 × 𝑁, defined by (𝑎, 𝑏)𝑅 (𝑐, 𝑑) ⇔ 𝑎𝑑 (𝑏 + 𝑐) =
𝑏𝑐(𝑎 + 𝑑).
Check whether R is an equivalence relation on 𝑁 × 𝑁.Find the equivalence
class of [(2 , 5)].
9. Let R be defined on 𝐴 = {1,2,3,4,5} by 𝑅 = {(𝑎, 𝑏): |𝑎2 − 𝑏 2 | < 8}. 𝐹𝑖𝑛𝑑 𝑅.
10. If 𝑅1 and 𝑅2 are equivalence relations on a set A, show that 𝑅1 ∩ 𝑅2 is also an
equivalence relation.

11. If 𝑅1 and 𝑅2 are equivalence relations on a set A, show that 𝑅1 ∪ 𝑅2 is reflexive,


symmetric but not transitive.

12.Find the maximum number of equivalence relations on the set A={1,2,3} and list
them. From that find the smallest equivalence relation.

13.Let R be defined on A={1,2,3,4,5} by 𝑅 = {(𝑎, 𝑏): |𝑎2 − 𝑏 2 | < 8}. 𝐹𝑖𝑛𝑑 𝑅.

14.Write the ordered pairs to be added to R={(1,1),(2,2),(3,3),(1,3)}defined on A={1,2,3}


to make it the smallest equivalence relation.

15.Let A={1,2,3} and consider the relation R={(1,1),(2,2)(3,3),(1,2),(2,3),(1,3)}, then R is --


------ type of relation.

16.Let A={1,2,3}, then list the number of relations containing (1,2) and(1,3) which are
reflexive and symmetric but not transitive.

17.Let A={1,2,3}, then the number of equivalence relations containing (1,2) is ------.

18.Check whether the relation R in R defined by R={(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 } is reflexive,


symmetric and transitive.
19.Let A and B be finite sets containing 3 and‘2 elements respectively. Find
i) Number of relations from A to B
ii) Number of functions from A to B
iii) Number of one-one functions from A to B
Iv) Number of on-to functions from A to B
v) Number of bijections from A to B

20. Assertion(A):Let L be the collection ofall lines in a plane and R be the relation on Las
𝑅 = {(𝐿1 , 𝐿2 ) :𝐿1 ⊥ 𝐿2 } is symmetric.

Reason(R): A relation R in a set A is said to be an symmetric relation if (𝑎, 𝑏)𝜖𝑅 ⇒ (𝑏, 𝑎)𝜖𝑅.
21. Assertion(A):Let 𝑓: 𝑅 → 𝑅 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦 𝑓(𝑥) = 𝑥 𝑡ℎ𝑒𝑛 𝑓(𝑥)𝑖𝑠 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.
Reason(R):A function 𝑔: 𝐴 → 𝐵 is said to be onto function if for each
𝑏 𝜖 𝐵, ∃ 𝑎𝜖𝐴 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑔(𝑎) = 𝑏.
22. Assertion(A):Let 𝑓: 𝑅 → 𝑅 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦 𝑓(𝑥) = 𝑥 2 𝑡ℎ𝑒𝑛 𝑓(𝑥)𝑖𝑠 𝑜𝑛 − 𝑡𝑜 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.
Reason(R): A function 𝑔: 𝐴 → 𝐵 is said to be onto function if g(A)= B ie range of g = B.

You might also like