MAT125 Final
MAT125 Final
MAT125 Final
Department of Mathematics
LINEAR ALGEBRA
[MAT - 125]
FINAL
1
Chapter 4
Vector
We know about two types of quantity. They are:
Vector quantity: The value of a vector quantity will be changed if the magnitude or the
direction or both are changed.
Example: Velocity.
Scalar quantity: The value of scalar quantity will be changed only if the magnitude is
changed .It has no particular direction.
Example: Speed.
Modulus or Magnitude: If a̅ is a vector then modulus of a̅ is |a̅|=a
Unit vector: A vector a̅ is called a unit vector if |a̅| = 1 and it is written in the following
𝑎̅
form â= |𝑎̅|
Scalar Product: If a̅ and b̅ are two vectors and ѳ is the angle between the two vectors
then the scalar product of a̅ and b̅ will be a̅.b̅ = abcosѳ .
b̅
a̅
If r̅ is a vector then the magnitude of r̅ will be |r|= √𝑥12 + 𝑥22 + 𝑥32 ; where r̅ = x1i + x2 j+ x3
k
Vector Product: If a̅ and b̅ are two vector and Ѳ is the angle between the two vectors,
then the vector product of a̅ and b̅ will be
a × b = ή ab sin Ѳ
2
Euclidean inner product, norm and distance in n and Cn.
Example 4: Given, u 2,1, 3,0, 4 , v 5, 3, 1, 2,7 . Find the Euclidean norm, Euclidean
inner product and Euclidean distance of u, v.
Example 5: Let u = (-3, 2, 1, 0) , v = (4, 7, -3, 2) and w = (5,-2, 8, 1). Find the value of x such
that 5x-2v = 2(w-5x)
Example 6: Given u 2, 1 ,3 , v 2, 14 , 2 k . For which value of k are u and v orthogonal?
Example 8: Given u 2, 3k , 4,1,5 , v 6, 1,3,7 , 2 k For which value of k are u and v
orthogonal?
w
Example 9: Show that if w is a non zero vector in n , then 1.
w
3
Vector space
Binary operation:
Let S be a non empty set. Then S × S = { (a, b) | a Є S ,b Є S}
∴ £S×S⟶S
Vector space:
A vector is a non – empty set V whose elements are called vectors which satisfy vector
addition & scalar multiplication.
1. Vector addition:
i) Cumulative law : a̅ , b̅ Є V
a̅+b̅ = b̅ + a̅
ii) Associative law: a, b, c Є V
(a̅+b̅)+c̅ = a̅ + (b̅+c̅)
2. Scalar multiplication :
∝(a̅+ b̅ ) = α a̅+α b̅
4
#Example: Show that V = (x, y, 0) is a vector space.
Solution: Let,
V1 = (x1, y1, 0) 𝜖 V
V2= (x2, y2, 0) 𝜖 V
V3= (x3, y3, 0) 𝜖 V
(1)Vector addition:
∴ V1+V2 = V2+V1
(ii) V1+ (V2+V3) =(x1, y2, 0) + (x1, y2, 0) + (x3, y3, 0)
= (x1+x2+x3, y1+y2+y3, 0)
= (x1+x2, y1+y2, 0) +(x3+y3, 0)
∴ V1+ (V2+V3) = (V1+V2) +V3
(2)Vector multiplication:
(i) For 𝛼 𝜖 ℝ
(ii) 𝛼 * (V1+V2)
= 𝛼*(x1+x2, y1+y2, 0)
= (𝛼x1+𝛼x2, 𝛼y1+𝛼y2, 0)
5
Subspace:
Let, V be a vector space and w 𝜖 V if w is a vector space with respect to the same operations as
in V, then w is called a subspace of V.
𝛼w1+𝛽w2 𝜖 w
Solution:
u = (a,0,c) 𝜖 ℝ3
and v = (a1,0,c1) 𝜖 ℝ3
and 𝛼,𝛽 𝜖 ℝ3
∴ u+v = 𝛼*(a,0,c)+𝛽*(a,0,c)
= (𝛼a,0,𝛼c)+(𝛽a,0,𝛽c)
= (𝛼a+𝛽a,0,𝛼c+𝛽c) 𝜖 ℝ3
s is a subspace of ℝ3
𝑎 𝑏 0
Show that w = is a subspace of M23
0 𝑐 𝑑
Solution:
𝑎1 𝑏1 0
M1 = 𝜖 M23
0 𝑐1 𝑑1
𝑎2 𝑏2 0
M2 = 𝜖 M23
0 𝑐2 𝑑2
and 𝛼,𝛽 𝜖 ℝ
𝑎1 𝑏1 0 𝑎2 𝑏2 0
∴ 𝛼M1+𝛽M2 = 𝛼 * + 𝛽*
0 𝑐1 𝑑1 0 𝑐2 𝑑2
6
𝛼𝑎1 𝛼𝑏1 0 𝛽𝑎2 𝛽𝑏2 0
= +
0 𝛼𝑐1 𝛼𝑑1 0 𝛽𝑐2 𝛽𝑑2
𝛼𝑎1𝛽𝑎2 𝛼𝑏1𝛽𝑏2 0
= 𝜖 M23
0 𝛼𝑐1𝛽𝑐2 𝛼𝑑1𝛽𝑑2
Linear combination
V3 =(1,1,0)
S = {V1, V2,V3}
Solution:
Let, 𝛼 1,2,𝛼3 𝜖 ℝ
(2,1,5) = 𝛼1(1,2,1)+𝛼2(1,0,2)+𝛼3(1,1,0)
𝛼1+𝛼2+𝛼3=2
2𝛼1+𝛼3=1
𝛼1+2𝛼2=5
7
3 −1 1 1 1 1
Example 2: Show that A = is linear combination of A1 = A2 =
1 −2 0 −1 −1 0
1 −1
and A3 =
0 0
Solution:
Let, 𝛼 1,2,𝛼3 𝜖ℝ
3 −1 1 1 1 1 1 −1
=𝛼1 +𝛼2 + 𝛼3
1 −2 0 −1 −1 0 0 0
3 −1 𝛼1 + 𝛼2 + 𝛼3 𝛼1 + 𝛼2 − 𝛼3
=
1 −2 −𝛼2 −𝛼1
Eqn 1: 𝛼1 + 𝛼2 + 𝛼3 = 3
Eqn 2: 𝛼1 + 𝛼2 − 𝛼3 = -1
Eqn 3: -𝛼2 = 1
Eqn 4: −𝛼1 = -2
#Span or generate:
Let,S 𝜖 V .The set spans V if every vectors in V is a linear combination of vectors in S.
Eqn 1: 𝛼1 = a
Eqn 2: 2𝛼1+ 𝛼2 = b
⇒ 𝛼2 = b-2a
8
Eqn 3: 3 𝛼1+2𝛼2+𝛼3 = c
⇒ 𝛼3 = c+a -2b
Solution:
&Let, 𝛼1,2,𝛼3 𝜖ℝ
Eqn 1: 𝛼1+2 𝛼1 = 1
Eqn 3: 35𝛼1+3𝛼3 = -3
Other wise,
−1 −2
# Example 1: Test the dependence of V1 = 1 ,V2 = 0 .
0 1
0 1
Solution: Let,1,𝛼2,𝛼3 𝜖ℝ
∴ 𝛼1V1+𝛼2V2 = 0
9
−1 −2 0
⇒𝛼1 1 + 𝛼2 0 = 0
0 1 0
0 1 0
Eqn 1: -𝛼1-2𝛼2 = 0
Eqn 2: 𝛼1 = 0;
𝛼2 = 0;
2 0 4
#Example 2: Test the dependence of V1 = 1 ,V2 = 1 ,V3 = 3
2 −1 3
Solution: Let,1,𝛼2,𝛼3 𝜖ℝ
∴ 𝛼1V1+𝛼2V2+ 𝛼3V3 = 0
2 0 4
⇒ 𝛼1 1 + 𝛼2 1 + 𝛼3 3 =0
1 −1 3
Eqn 1: 2𝛼1+4𝛼3 = 0
Eqn 3: 2𝛼1-𝛼2+ 𝛼3 = 0
2 0 4
Linear eqn : 1 1 3
2 −1 3
2 0 4
= 0 2 2
0 −1 −1
Since the resulting system of linear equation has multiple solutions, then the given set of vectors
is linearly dependent.
10
Example 3: Test the dependence of V1 = (2,-1,4),V2 =(3,6,2),V3 = (2,10,-4)
∴ 𝛼1V1+𝛼2V2+ 𝛼3V3 = 0
Eqn 1: 2𝛼1+3𝛼2+2𝛼3 = 0
Eqn 3: 2𝛼1-𝛼2-4𝛼3 = 0
𝛼1=𝛼2=𝛼3=0;
Basis:
A set of vectors S ={x1,x2,x3,…………………….,xn} in a vector space V is called a basis for V
if
Example1: Show that S = {V1,V2,V3} for a basis for a basis for ℝ3 ,were V1 = (1,2,0),V2 =
(0,5,7),
V3 =(-1,1,0)
Let, 𝛼1,2,𝛼3 𝜖ℝ .
∴ 𝛼1V1+𝛼2V2+ 𝛼3V3 = 0
Eqn 1: 2𝛼1-𝛼3 = 0
Eqn 3: 7𝛼2+3𝛼3 = 0
𝛼1=𝛼2=𝛼3=0;
11
Again, Let (a,b,c) 𝜖ℝ3
Eqn 1: 2𝛼1-𝛼3 = a
Eqn 3: 7𝛼2+3𝛼3 = c
7𝑏−8𝑎−5𝑐
𝛼1 = 6
−(𝑏−2𝑎−𝑐)
𝛼2 =
2
7𝑏−14𝑎−5𝑐
𝛼3 = 6
The given set of vectors is linearly independent & spans ℝ3 .So it form a basis for ℝ3 .
Dimension:
The dimension of a finite dimensional vector space V is the number of vector is any basis of it.
A basis for a vector space V is never unique. Because if (V1,V2,V3)is basis for V then
(V1,V2,V3)is also a basis from V.
Example 1: The vectors (1,1)&(1,0)find a basis for ℝ2 ,find the dimension too.
Solution:
Let, 𝛼1,2 𝜖ℝ .
∴ 𝛼1V1+𝛼2V2 = 0
Eqn 1: 𝛼1+𝛼2 = 0
Eqn 2: 𝛼1 = 0
12
∴ 𝛼2=0;
: Let, a,b 𝜖ℝ .
∴ 𝛼1V1+𝛼2V2 = (a,b)
Eqn 1: 𝛼1+𝛼2 = a
Eqn 2: 𝛼1 = b
∴ 𝛼2=a-b;
The given set of vectors is linearly independent & spans ℝ2 .So it form a basis for ℝ2 .
Its dimension is 2.
Example 2:
Solution : (i)
S = {(x,y,z|t)y-2z+t = 0}
Dimension of S = 3.
13
(ii)
Dimension of T =2.
(iii)
S = {(x,y,z|t)y-2z+t = 0}
Dimension of 𝑆 ⋂ 𝑇 = 1.
14
Linear Transformation
Example 1: Let T : ℝ2 →ℝ3 be denoted by T(u) = (x, x+y, x-y) where u(x, y) is a vector in ℝ2 ,show
that T is a linear transformation.
Solution:
= (x1+x2,y1+y2)
T(u1+u2) = T (x1+x2,y1+y2 )
= ((x1,x1+y1,x1-y1)+( x2,x2+y2,x2-y2))
= T(x1,y1)+T(x2,y2)
= T(u1)+(u2)
Let , c 𝛜 ℝ
T(cu1) = T (cx1,cy1 )
= (cx1,cx1+cy1, x1-y1)
= c(x1,x1+y1,x1-y1)
= cT(u1)
15
Example 2: Let T : ℝ2 →ℝ2 be denoted by T (x,y) = (xcosѲ-ysinѲ, xsinѲ+ycosѲ ) ,show that T is a
linear transformation.
Solution:
= (x1cosѲ-y1sinѲ, x1sinѲ+y1cosѲ)
T(u2) = T(x2,y2)
= (x2cosѲ-y2sinѲ, x2sinѲ+y2cosѲ)
= (x1+x2, y1+y2)
T(u1+u2) = T(x1+x2,y1+y2)
= T(u1)+(u2)
Let , c 𝛜 ℝ
T(cu1) = T (cx1,cy1 )
= (cx1cosѲ-cy1sinѲ,cx1sinѲ+cy1cosѲ)
= c(x1cosѲ-y1sinѲ,x1sinѲ+y1cosѲ)
= cT(u1)
16
One- one transformation:
A linear transformation T: V →W is called one – one if it is one-one function ,that is 𝛼1 ≠ 𝛼2
i)T(0) =0
Linear operation: let ,V be a vector space if linear transformation T:V→V is a linear transformation
from V into itself. Then T is called linear operation.
If T1 & T2 be two linear transformations from u into v then we define their T1+T2 as
(T1+T2)=T1(u)+T1(x).
i.e T1 = U → V
T2 = U → V
Zero transformation: if U & V be two vector spaces ,then zero transformation is denoted by 0 : U→V
Example1: if S: ℝ2 →ℝ2 and T: ℝ2 →ℝ2 defined by S(x,y) = (3x+2y, -6x+y) ,T(x,y) = (2x+y,x-y) then
find S+T,ST,TS,𝑆 2 , 𝑇 2.
Solution:
= (3x+2y,-6x+y)+( 2x+y,x-y)
= (5x+3y,-5x)
17
= (8x+y,-11x-7y)
= (5y,9x+y)
= (-9x+8y,-24x-11y)
Kernel of T:
Let T:V→ W be a linear transformation. Then the kernel of T is the subset of V. Consisting of all
elements 𝛼 of V such that T (𝛼) = 0w.
Solution:
(S+T)(x,y,z) = (x+2y+z,z,x)
(S+T)(x,y,z) = (x+y+z,0,0)
Eqn 1: x+2y+z = 0
Eqn 2: z = 0
Eqn 3: y = 0
∴x=0
18
(TS) (x,y) = T(S(x,y)) = T(3x+2y, -6x+y) = (2(3x+2y)+(-6x+y)),((3x+2y)- (-6x+y))
= (5y,9x+y)
= (-9x+8y,-24x-11y)
Solution:
T(x,y,z) = (x+2y,y-z,x+2z)
T(x,y,z) = (0,0,0)
Eqn 1: x+2y = 0
Eqn 2: y-z = 0
Eqn 3: x+2z = 0
19
Let ,y = 1;
z = 1;
x = -2
∴Dimension of kernel of T = 1
∴nullity of T = 1
T(1,0,0) = (1,0,1)
T(0,1,0) = (2,1,0)
T(0,0,1) = (0,-1,2)
1 0 1
∴ 2 1 0
0 −1 2
1 0 1
≈ 0 −1 2
0 1 −2
1 0 1
≈ 0 −1 2
0 0 0
∴Dimension of image of T = 2.
∴Rank of T =2.
20
Example 2: Given T: ℝ3 → ℝ3 defined by T(x,y,z) = (x+2y-z,y+z,x+y-2z).Find the rank & nullity of T.
Solution:
T(x,y,z) = (x+2y-z,y+z,x+y-2z)
T(x,y,z) = (0,0,0)
⇒(x+2y-z,y+z,x+y-2z)= (0, 0, 0)
Eqn 2: y+z = 0
⇒y = -z
Eqn 1: x+2y-z = 0
⇒ x-2z-z = 0
⇒x-3z = 0
Eqn 3: x+y-2z = 0
⇒ x-z-2z = 0
⇒x-3z = 0
Let,
z = 1,
∴y = -1
∴x = 3
∴Dimension of kernel of T = 1
∴nullity of T = 1
T(1,0,0) = (1,0,1)
T(0,1,0) = (2,1,1)
21
T(0,0,1) = (-1,1,2)
1 0 1
∴ 2 1 1
−1 1 −2
1 0 1
≈ 0 1 −1
0 1 −1
1 0 1
≈ 0 1 −1
0 0 0
∴Dimension of image of T = 2.
∴Rank of T =2.
Solution:
T(x1,x2,x3,x4) = (x1-x2+x3+x4,x1-2x3-x4,x1+x2+3x3-3x4)
T(x,y,z) = (0,0,0)
Eqn 1:
x1-x2+x3+x4 = 0
Eqn 2:
22
x1-2x3-x4 = 0
Eqn 3:
x1+x2+3x3-3x4 = 0
Eqn 2: y+z = 0
⇒y = -z
Eqn 1: x+2y-z = 0
⇒ x-2z-z = 0
⇒x-3z = 0
Eqn 3: x+y-2z = 0
⇒ x-z-2z = 0
⇒x-3z = 0
Let,
z = 1,
∴y = -1
∴x = 3
∴Dimension of kernel of T = 1
∴nullity of T = 1
T(1,0,0) = (1,0,1)
T(0,1,0) = (2,1,1)
T(0,0,1) = (-1,1,2)
23
1 0 1
∴ 2 1 1
−1 1 −2
1 0 1
≈ 0 1 −1
0 1 −1
1 0 1
≈ 0 1 −1
0 0 0
∴Dimension of image of T = 2.
∴Rank of T =2.
Example1: Consider the basis u = { u1,u2,u3} for ℝ3 where u1= (1,-1,2), u2= (2,1,-3),
Solution:
Eqn 1:
⇒ 𝛼1-2𝛼2+𝛼3 = 5
Eqn 2:
⇒ -𝛼1+𝛼2 = -2
Eqn 3:
⇒ 2𝛼1-3 𝛼2-2𝛼3 = 7
⇒ 𝛼1 = 19/5
⇒ 𝛼2 = 9/5
24
⇒ 𝛼3 = -12/5
Therefore,
= 19/5(-3,-1)+9/5(9,0) -12/5(2,-2)
= (-57/5+81/5-24/5,-19/5+0+24/5)
= (0, 1)
Example2: Consider the basis u = { u1,u2,u3} for ℝ3 where u1= (2,-1,3), u2= (-1,3,5),
Solution:
Eqn 1:
⇒ 2𝛼1-𝛼2-2𝛼3 = 5
Eqn 2:
⇒ -𝛼1+3𝛼2+3𝛼3 = -2
Eqn 3:
⇒ 3𝛼1+5 𝛼2-4𝛼3 = 0
⇒ 𝛼1 = 107/31
⇒ 𝛼2 = -29/31
⇒ 𝛼3 = 44/31
25
(5,-2,0) = 107/31(2,-1,3)-29/31(-1,3,5)+44/31(-2,3,-4)
Therefore,
= (-4,13,15)
26
Application of Linear Algebra
LP is powerful tool used by operations managers and other managers to obtain optimal (maximum profit
or minimum cost) solutions to problems that involve restrictions or limitations such as available materials,
labor, machine time, budgets etc.
Formulation: Modeling is the essence of the OR approach. The most important skill that we need to
learn is gaining facility in formulating, manipulating and analyzing mathematical models.
In another word, “The model is a vehicle for arriving at a well-structured view of reality”.
Formulation of LP: There are three basic steps in constructing an LP model which are:
Step1: Identify the unknown variables (decision variables) to be determined and represent them in terms
of algebraic symbols.
Step 2: Identify all the restrictions (or constraints) in the problem and express them as linear equations
or equalities which are linear functions of unknown variables.
Step 3: Identify the objective (Objective functions) and represent it as a linear function of decision
variables which is to be maximized or minimized.
Model building is not a science but primarily an art and comes mainly by practice. Hence the readers are
advised to work out as many exercises as possible on problem formulation.
27
Common terminology for general LP problems:
For the general problem of allocating resources to activities, the following symbols are used:
Data for a general LP model involving the allocation of resources to activities can be presented as
follows.
1 a 11 a 12 a1n b1
2
a 21 a 22 a2n b2
.
. .
.
. .
.
a m1 a m 2 ......................................... a mn bm
m
28
Contribution to Z per c1 c2 cn
unit of activity
n
Maximize Z c1 x1 c 2 x 2 ......... c n x n c j x j ................................(1)
j 1
a 21 x1 a 22 x 2 .......... ... a 2 n x n b 2
..................................................... ..................................(2)
.....................................................
a m1 x1 a m 2 x 2 .......... ... a mn x n b m
n
a ij x j , i 1, 2,...., m
j 1
x j 0 , i 1, 2 ,..... n. .................................(3)
Feasible Solution: xj (j =1,2,……,n ) is a FS of the standard LP problem if it satisfies conditions (2) and (3).
Basic solution:
A basic solution to (2) is a solution obtained by setting (n-m) variables equal to zero and solving for the remaining m
variables, provided the determinant of the coefficient of these m variables are non-zero. The m variables are called
basic variables.
A basic feasible solution is a basic solution, which also satisfies (3), that is, all basic variables are non-negative.
Extreme point (vertex): A point x in a vertex set S is an extreme point of S if there do not exist two distinct points x 1
29
A basic feasible solution to the LP is said to be optimal if it maximizes (or minimizes) the objective function while
satisfying condition (2) and (3) provided the maximum (or minimum) value exists.
Example 1: A company wishes to schedule the product of a kitchen appliance that requires two resources:
labor and raw materials. The company is considering three different types of products (A, B, C). To produce
one unit of product A, it requires 7 hours of labor and 4 pounds of raw materials. To produce one unit of
product B, it requires 3 hours of labor and 4 pounds of raw materials. To produce one unit of product C, it
requires 6 hours of labor and 5 pounds of raw materials. Profit from each unit of product A is Tk. 4. Profit
from each unit of product B is Tk. 2. Profit from each unit of product C is Tk. 3. The supply of raw materials
is restricted to 200 pounds per day. The daily availability of labor is 150 hours.
Formulate an LP model to determine the daily production rate of the various types of products in order to
maximize the total profit.
Solution:
A B C
Labor 7 3 6 150
Contribution to Z per 4 2 3
unit of activity
Max Z 4 x1 2 x 2 3 x 3
subject to 7 x1 3 x 2 6 x 3 150
4 x1 4 x 2 5 x 3 200
x1 , x 2 , x 3 0 .
30
The given problem has two resources so the number of constraints is two.
The given problem has three activities so the number of decision variables is three.
Example 2: A company is planning to produce two products (high quality glass products including
windows and glass doors) in three plants. Plant I can produce 1 unit of Product 1 and 0 unit of Product 2
per hour. Plant II can produce 0 unit of Product 1 and 2 unit of Product 2 per hour. Plant III can produce 3
unit of Product 1 and 2 unit of Product 2 per hour. Available production time in Plant I is 4 hours per
week, in Plant II 12 hours per week and in Plant III 18 hours per week. The company can sell as much of
either product as could be produced by the plants. Profit from Product 1 is Tk. 3000 per unit and profit
from Product 2 is Tk. 5000 per unit.
Formulate an LP to determine which mix of product to be produced for the maximum profit.
Solution:
Plant I 1 0 4
Plant II 0 2 12
Plant III 3 2 18
Max Z 3 x1 5 x 2
subject to x1 4
2 x 2 12
3 x1 2 x 2 18
x1 , x 2 0 .
31
Example 3: A diet is to contain at least 80 units of carbohydrate, 50 units of fat and 120 units of
protein. Two foods F1 and F 2 are available: F1 costs Tk. 3 per unit and F 2 costs Tk. 5 per unit. A
unit of food F1 contains 2 units of carbohydrate, 2 units of fat and 3 units of protein, and a unit of
food F 2 contains 5 units of carbohydrate, 1 unit of fat and 4 units of protein.
Find the minimum cost for a diet that consists of a mixture of these two foods and also meets the
minimum nutrition requirements. Formulate the LP.
Solution:
Carbohydrate 2 5 80
Fat 2 1 50
Protein 3 4 120
Min Z 3 x1 5 x 2
subject to 2 x1 5 x 2 80
2 x1 x 2 50
3 x1 4 x 2 120
x1 , x 2 0 .
32
Example 4: For the following LP
max 2 x1 x 2
s.t. x1 3 x 2 9
x1 8
x1 2 x 2 16
x1 , x 2 0
a. Solve it graphically.
b. How many basic solutions are there? How many are feasible?
c. Find the basis and basic variables for each feasible corner point.
Solution:
(a) Graphically
8 Iso-profit
line
x2
optimal
solution
O
Feasible
region
O
8
x1
Binding constraints are x1 8 and x1 + 2 x2 16, so the solution is x1 = 8 and x2 = 8/2 = 4 and the optimal
solution value is z = 2×8 + 4 = 20
(b) How many basic solutions are there? How many are feasible?
(c) Find the basis and basic variables for each feasible corner point.
33
Example 5:
Subject to:
Land, c + w ≤ 7,
Govt regulations, c ≥ 3,
w, c ≥ 0.
Graphically
W
7
4
Obj. fn Optimal
(z = 300)
3 x x
a b
x
2 d
1 x 2 3 4 5 6 7 8 9 10
c
(Govt) (Land) (Labour)
34
Application of Matrix
1. There are two families A and B. There are 5 men 6 women and 3 children in family A and 3 men
4 women and 5 children in family B. The recommended daily allowance for calories is: man
2400, woman: 1900, child: 1800 and for proteins is: man 55 gm, woman 45 gm and child: 33 gm.
Represent the above information by matrices. Using matrix multiplication, calculate the total
requirement of calories and protein for each of the two families.
2. Use matrix multiplication to divide $30,000 in two parts such that the total annual interest at 9%
on the first part and 11% on the second part amounts $3060.
3. Use matrix multiplication to divide $50,000 in two parts such that the total annual interest at 5%
on the first part and 6% on the second part amounts $2780.
4. Use matrix multiplication to divide $80,000 in two parts such that the total half-yearly interest at
5% on the first part and 12% on the second part amounts $9000.
5. A man invested $30000 partly in a bank fetching interest at the rate of 9% per annum and the rest
in a company fetching interest at rate of 18% per annum. At the end of the year, he received
annual interest of $4500. Using matrix methods find how much money is invested in both the
schemes.
6. A man invested $30000 in three investments at rate of 6%, 8%, and 9% per annum respectively.
At the end of the year, he received annual interest of $4800. Using matrix methods find how
much money is invested in the schemes.
7. A man produces three products A, B, and C which it sales in two markets. Annual sales in units
are given below:
Markets Unit sold
A B C
I 600 300 1200
II 500 1400 700
If the prices per unit of A, B, and C are Tk. 4, Tk. 2 and Tk. 1.5 respectively and the cost per unit
of A, B, and C are Tk. 2, Tk. 1 and Tk. 0.5 respectively, find the total profit in each market by
using matrix algebra.
8. A man produces three products A, B, and C which it sales in two markets. Annual sales in units
are given below:
Markets Unit sold
A B C
I 5000 4000 3000
II 2000 1500 1000
35
If the prices per unit of A, B, and C are Tk. 3.5, Tk. 3 and Tk. 2.5 respectively and the cost per
unit of A, B, and C are Tk. 3, Tk. 2.5 and Tk. 2 respectively, find the total profit in each market
by using matrix algebra.
9. A chemical manufacturer wants to purchase a fleet of 24 rail road tank cars with combined carrying
capacity of 250,000 gallons. Tank cars with three different carrying capacities are available: 6000
gallons, 8000 gallons, and 18000 gallons. How many of
each type of tank cars should be purchased?
36