Solution

REVISSION TEST : MATRICES,DETERMINANTS & LPP(24-02-2024)

Class 12 - Applied Mathematics

1.
(c) n × m
Explanation: n × m
2.
(c) 1
3 −2 3 −2 3 −2 1 0
Explanation: [ ][ ] = k[ ] -2[ ]
4 −2 4 −2 4 −2 0 1

1 −2 3k − 2 −2
[ ] =[ ]
4 −4 4 −2k − 2

3k - 2 = 1
Hence, k = 1
3.
(c) Skew-symmetric matrix
Explanation: Skew-symmetric matrix
4.
(c) Not possible to find
Explanation: In the given question:
3x + 7 5 0 y − 2
[ ]= [ ]
y + 1 2 − 3x 8 4

Since, the given matrices are equal, their corresponding elements are also equal.
Comparing the corresponding element, we have:
3x + 7 = 0
7
⇒ x = −
3

Also, 5 = y – 2
⇒ y = 7

Again, y + 1 = 8
⇒ y = 7

And 2 – 3x = 4
2
⇒ x = −
3

Therefore, on comparing the corresponding elements of the two matrices, we get different values of x, which is not possible.
Thus, it is not possible to find the values of x and y for which the given matrices are equal.
2 −1
5. Let A = [ ] . Then,
3 4

∣2 −1 ∣
|A| = ∣ ∣ = 8 + 3 = 11 ≠ 0
∣3 4∣

So, A is a non-singular matrix and therefore it is invertible. Let Cij be cofactor of aij in A. Then, the cofactors of elements of A are
given by
C11 = 4, C12 = -3, C21 = -(-1) = 1 and C22 = 2
T
4 −3 4 1
∴ adj A = [ ] = [ ]
1 2 −3 2

4 1 4/11 1/11
Hence, A-1 = 1

|A|
adj A = 11
1
[ ]= [ ]
−3 2 −3/11 2/11

6. Since the product of matrices is associative. Therefore, we can find ABC either by computing (AB)C or by computing A(BC). Let
us compute A(BC).
Since B is a 3 × 3 matrix and C is 3 × 1 matrix. Therefore, BC is of order 3 × 1.
a h g x ax + hy + gz
⎡ ⎤⎡ ⎤ ⎡ ⎤

Now, BC = ⎢ h b f ⎥⎢y ⎥ = ⎢ hx + by + f z ⎥
⎣ ⎦⎣ ⎦ ⎣ ⎦
g f c z gx + f y + cz

1/7
 Clearly, A is of order 1 × 3 and BC is of order 3 × 1. Therefore, A(BC) is of order 1 × 1.
Now,
ax + hy + gz
⎡ ⎤

A(BC) = [ x y z ] ⎢ hx + by + f z ⎥
⎣ ⎦
gx + f y + cz

⇒ A(BC) = x(ax + hy + gz) + y(hx + by + fz) + z(gx + fy + cz)

⇒ A(BC) = ax2 by2 + cz2 + 2hxy + 2fyz + 2gzx
7.
(d) a function to be optimized
Explanation: A Linear programming problem is a linear function (also known as an objective function) subjected to certain
constraints for which we need to find an optimal solution (i.e. either a maximum/minimum value) depending on the
requirement of the problem.
From the above definition, we can clearly say that the Linear programming problem's objective is to either maximize/minimize
a given objective function, which means to optimize a function to get an optimum solution.
8.
(b) (0, 8)
Explanation: (0, 8)
9. (a) 5
Explanation: (1, 1), (1, -1), (-1 , -1), (2, -1) and (-2, -1) satisfy the inequality 2x - 3y > - 5.
10.
(b) (0, 5)
Explanation:
Corner Points Z = 7x + y

(3, 0) 21
1 5
(
2
,
2
) 6

(7, 0) 49 (minimum)

(0, 5) 5

11. Let the number of automobiles produce be x and let the number of trucks produced be y.
Let Z be the profit function to be maximized.
Z = 2000 x + 30000 y
The constraints are on the man hours worked
Shop A: 2x + 5y ≤ 180 ...(i) assembly
Shop B: 3x + 3y ≤ 135 ...(ii) finishing
x, y ≥ 0
Corner points can ve obtained from:
2x = 3y + 5y = 180 ⇒ x = 0; y = 36 and x = 90; y = 0
3x + 3y ≤ 135 ⇒ x = 0; y = 45 and x = 45; y = 0
Solving (i) and (ii) gives x = 15 and y = 30
Corner point Value of Z = 2000x + 30000x

0, 0 0

0, 36 10,80,000

15, 30 9,30,000

45, 0 90,000
Thus 0 automobiles and 36 trucks give a max. profit of ₹10,80,000
12. Minimize and maximize Z = x + 2y subject to the constraints
x + 2y ≥ 100, 2x - y ≤ 0, 2x + y ≤ 200, x ≥ 0, y ≥ 0.

2/7
 Draw the lines x + 2y = 100, 2x - y = 0 and 2x + y = 200; and shade the region satisfied by the given inequalities. The feasible
region is polygon ABCD, which is convex and bounded.

Corner points of feasible region are A(20, 40) B(50, 100) C(0, 200) and D (0, 50).
The values of Z at the points A, B, C and D are 100, 250, 400 and 100 respectively.
Maximum value = 400 at C(0, 200),
minimum value = 100 at A(20, 40) and D(0, 50)
In fact, all points on the line segment AD has same minimum value = 100.
13. The given data can be shown in a table as follows:
Product Machine Hours Labour Hours Profit

A 1 1 ₹ 60

B - 1 ₹ 80

Total Capacity Minimum capacity of product B is 200 units 400 for A 500
Let production of product A be x units and of B be y units.
Given,
Profit on 1 unit of product A = ₹60
Profit on 1 unit of product B = ₹ 80
So, profit on x units of A and y units of B is 60x and 80y respectively.
Let z = total profit,
So, we have
z = 60x + 80y
Given, a minimum supply of product B is 200
So, y ≥ 200 (First constraint)
Given that, production of one unit of product A requires 1 hour of machine-hours, so x units of product A require x hours but the
total machine time available for product A is 400 hours
So, x ≤ 400 (Second constraint)
Given, each unit of product A and B requires one hour of labour hour, so x units of product A require x hours and y units of
product B require y hours of labour hours, but the total labour hours available is 500 so
x + y ≤ 500 (Third constraint)
Hence, mathematical formulation of LPP is,
Find x and y which
Minimize z = 60x + 80y
Subject to constraints,
y ≥ 200
x ≤ 400
x + y ≤ 500
and also, as production cannot be less than zero, so x, y ≥ 0
14. Let x be the number of first class tickets sold and y be the number of economy class tickets sold, then the problem can be
formulated as an L.P.P.as follows:
Maximize the profit (in ₹) = Z = 500x + 300y subject to the constraints
x + y ≤ 200 (capacity constraint)
30x + 20y ≤ 4500 (baggage capacity constraint)

3/7
 i.e. 3x + 2y ≤ 450
x ≥ 0, y ≥ 0 (non-negativity constraints)
Draw the lines x + y = 200 and 3x + 2y = 450, and shade the region satisfied by the above inequalities

The feasible region is polygon OABC, which is convex and bounded. The comer points are O(0, 0), A(150, 0), B(50, 150) and
C(0, 200).
The values (in ₹) of Z = 500x + 300y at the points A, B and C are 0, 75000, 70000 and 60000 respectively.
∴ Maximum profit = ₹ 75000, when 150 first class tickets and no tickets of economy class are sold.

15.
(d) x ≥ 0, y ≥ 0, 3x + 2y ≥ 12, x + 3y ≥ 11
Explanation: Since, the feasible region is outwards, thus linear constraints one.
3x + 2y ≥ 12
x + 3y ≥ 11
with non-negative restrictions i.e., x ≥ 0, y ≥ 0
16.
(c) 26
Explanation: |A| = d
|adj A| = |A|n - 1
Here, n = 3, |A| = 8
|adj A| = 82
|adj A| = (23)2 = 26
17. (a) 10
Explanation: We know that
A × adj A = |A| In× n , where I is the unit matrix of order n × n ...(i)
10 0
A (adj A) = [ ]
0 10

Using the above property of matrices (1), we get

1 0
A (adj A) = 10[ ]
0 1

A(adj A) = (10) I2× 2

|A| I2x2 = 10 I2× 2
|A| = 10
18. (a) λ = 1
∣ 2 −1 3∣
∣ ∣
Explanation: ∣ λ 0 7
∣
=0
∣ −1 1 4∣

⇒ 2(0 - 7) + 1(4 λ + 7)+3(λ - 0) = 0

⇒ -14 + 4λ + 7 + 3λ = 0
⇒ 7λ - 7 = 0 ⇒ λ = 1

19. (a) -7000

200 50 50 40 50 40
Explanation: As, AB = [ ] [ ][ ]
10 2 2 3 2 3

4/7
 10000 + 10 8000 + 150
AB = [ ]
504 406

10000 + 10 8150
AB = [ ] = 4100600 − 4107600 = −7000
504 406

20. Operating R1 → R1 + R2 + R3, we get

∣y + k y y ∣ ∣ 3y + k 3y + k 3y + k ∣
∣ ∣ ∣ ∣
∣
y y + k y
∣
=∣ y y + k y
∣
(Take(3y + k) common from R1)
∣ y y y + k∣ ∣ y y y + k ∣

∣1 1 1 ∣

= (3y + k)∣ y y + k y
∣
(Operate C2 → C2 - C1, C3 → C3 - C1)
∣ ∣
∣y y y + k∣

∣1 0 0∣
∣ ∣
= (3y + k)∣ y k 0
∣
∣y 0 k∣

= (3y + k)⋅ 1(k2 - 0) (Expand R1)

= k2(3y + k)
21. We have,
∣x − 1 1 1 ∣
∣ ∣
|A| = 1 x − 1 1
∣ ∣
∣ 1 1 x − 1∣

Expanding along the first row

∣x − 1 1 ∣ ∣1 1 ∣ ∣1 x − 1∣
|A| = (x − 1) ∣ ∣ − 1∣ ∣ + 1∣ ∣
∣ 1 x − 1∣ ∣1 x − 1∣ ∣1 1 ∣

= (x - 1) ((x - 1) (x - 1) - 1 × 1) - 1((x - 1) - 1 × 1) + 1(1 × 1 - 1 × (x - 1))

= (x - 1) (x2 - 2x + 1 - 1) - 1(x - 1 - 1) + 1(1 - x + 1)
= x(x - 1) (x - 2) - 1(x - 2) - (x - 2)
= (x - 2) {x(x - 1) - 1 - 1}
= (x - 2) (x2 - x - 2)
For singular |A| = 0,
(x - 2) (x2 - x - 2) = 0
(x - 2) (x2 - 2x + x - 2) = 0
(x - 2)(x - 2)(x + 1) = 0
∴ x = -1 or 2

22. The total sales (S) in thousands of rupees for products X and Y is given by
S = a + bX + cY =12 ...(i)
In January, we have
X = 2 ,Y = 3 and S = 12
Substituting these values in S = a + bX + cY , we obtain
a + 2b + 3c = 12
Similarly, for February and March months, we obtain
a + 6b + 2c = 13 [Putting X = 6, Y = 2, S = 13 in (i)]
a + 5b + 3c = 15 [Putting X = 5, Y = 3, S = 15 in (i)]
Thus, we obtain the following system of equations
a + 2b + 3c = 12
a + 6b + 2c = 13
a + 5b + 3c = 15
∣1 2 3∣
∣ ∣
∴ D=
∣
1 6 2
∣
= 1(18 - 10) - 2(3 - 2) + 3(5 - 6) = 3
∣1 5 3∣

∣ 12 2 3∣
∣ ∣
D1 =
∣
13 6 2
∣
= 12(18 - 10) - 2(39 - 30) + 3(65 - 90) = 3
∣ 15 5 3∣

5/7
 ∣1 12 3∣
∣ ∣
D2 =
∣
1 13 2
∣
= 1(39 - 30) - 12(3 - 2) + 3(15 - 13) = 3
∣1 15 3∣

∣1 2 12 ∣
∣ ∣
and, D 3 =
∣
1 6 13
∣
= 1(90 - 65) - 2(15 - 13) + 12(5 - 6) = 9
∣1 5 15 ∣

Using Cramer's rule, the solution is given by

D1 3 D2 3 D3 9
a= = = 1, b = = = 1, = = = 3
D 3 D 3 D 3

Substituting the values of a, b and c in S = a + bX + cY, we obtain

S = 1 + X + 3Y
When X = 4 and Y = 5, we obtain
S = 1 + 4 + 15 = 20
Hence, the sales in the month of April is of ₹ 20,000.
23. i. Given AB = I ⇒ |AB| = |I|
⇒ |A| |B| = 1 (∵ |I| = 1, property2)
⇒ (-2) |B| = 1 (∵ |A| = -2, given)

⇒ |B| = −
1

∣x + 4 2∣
ii. |A| = ∣ ∣ = (x + 4) × 1 - 3 × 2 = x - 2,
∣ 3 1∣

∣x 2x − 1 ∣
|B| = ∣ ∣ = x × 5 - 2 × (2x - 1) = x + 2.
∣ 2 5 ∣

Now |AB| = 12 ⇒ |A| |B| = 12 ⇒ (x - 2) (x + 2) = 12

⇒ x2 - 4 = 12 ⇒ x2 = 16 ⇒ x = 4, -4.
∣x 2 ∣
iii. |A| = ∣ ∣ = x2 - 4
∣2 x∣

Now |A4| = 625 ⇒ (|A|)4 = 625

⇒ (x2 - 4)4 = 625 ⇒ (x2 - 4)2 = 25 (∵ (x2 - 4)2 ≥ 0, ∀ x ∈ R)
⇒ x2 - 4 = ± 5 ⇒ x2 - 4 = 5 or x2 - 4 = -5
⇒ x2 = 9 or x2 = -1 (∵ x2 ≥ 0, ∀ x ∈ R)
⇒ x2 = 9 ⇒ x = 3, -3.
24. If ₹ 15000 is invested in bond X, then the amount invested in bond Y = ₹ (35000 - 15000) = ₹20000
X Y

A = Investment [ 15000 20000 ]

Invest rate Invest rate

X 10 % X 0.1
and B = [ ] = [ ]
Y 8 % Y 0.08

25. The amount of interest received on each bond is given by

0.1
AB = [15000 20000] × [ ]
0.08

= [15000 × 0.1 + 20000 × 0.08] = [1500 + 1600] = 3100

26. Let ₹ x be invested in bond X and then ₹ (35000 - x) will be invested in bond Y.
Now, total amount of interest is given by
0.1
[x 35000 - x] [ ] = [0.1x + (35000 - x) 0.08]
0.08

But, it is given that total amount of interest = ₹ 3200

∴ 0.1x + 2800 - 0.08x = 3200

⇒ 0.02 x = 400 ⇒ x = 20000

Thus, ₹ 20000 invested in bond X and ₹ 35000 - ₹ 20000

= ₹ 15000 invested in bond Y.
27. AB will give the total amount of interest received on both bonds.
28. Let ₹ x invested in bond X, then we have
x× 10

100
= 500 ⇒ x = 5000
Thus, the amount invested in bond X is ₹ 5000 and so investment in bond Y be ₹ (35000 - 5000) = ₹ 30000

6/7
29. Since profit from the sale of a lamp = ₹25
And profit from the sale of a shade = ₹15
The associative objective function is Max. Z = 25x + 15y

30. Lamp (x) Shade (y)

Cutting/grinding 2 2 12

Sprayer 3 3 20
So, constraints are:
2x + y ≤ 12
3x + 2y ≤ 20
31. The non-negative conditions are: x ≥ 0, y ≥ 0
32. Vertices of feasible region are O(0, 0), A(6, 0), B(4, 4), and C (0, 10).

33. Corner Points Z = 25x + 15y

O(0, 0) Z=0

A(6, 0) Z = 150

B(4, 4) Z = 160 → Maximum

C(0, 10) Z = 150

34. x - y = 50, 2x + y = 550
1 −1 x 50
35. [ ] [ ] =[ ]
2 1 y 550

36. 200 m
37. 150 m
38. 30000 sq.m.

7/7