UNIT 2: MATRIX ALGEBRA AND ITS APPLICATION

Contents
2.1. Matrix Concepts
2.2. Dimensions & Types of matrices
2.3. Matrix operation& Techniques
2.4. The multiplicative inverse of a matrix
2.5. Matrix Applications
2.5.1. Solving systems of linear equations
2.5.2. Markov Chains: Concepts, Models and Solutions
2.6. Summary

Unit Objectives

After reading this unit, students will be able to:

 Explain what a matrix is
 Define the different types of matrices
 Perform matrix operations
 Find inverse of a square matrix
 Explain how to solve a systems of linear equations
 Solve word problems applying matrices
 Understand the concept of Markov chain

 Introduction
Brevity in mathematical statements is achieved through the use of symbols. The price paid for
brevity, of course, is the effort spent in learning the meaning of the symbol.

In this unit we shall learn the symbols for matrices, and apply them in the statement and solution
of input-output problems and other problem involving linear systems

Page | 1
 2.1. Matrix Algebra Concepts

Algebra is a part of mathematics, which deals with operations (+, -, x, ).

A matrix is a rectangular array of real numbers arranged in m rows & n columns. It is

symbolized by a bold face capital letter enclosed by a bracket or parentheses.

A=¿ [ 11 12 1n ¿ ][ 21 22 2n ¿ ] ¿
a a −−−−−−a a a −−−−−−a ¿
eg. ¿ in which ajj are real numbers

Each number appearing in the array is said to be an element or component of the matrix. Element
of a matrix are designated using a lower case form of the same letter used to symbolize the
matrix itself. These letters are subscripted as a ij, to give the row & column location of the
element within the array. The first subscript always refers to the raw location of the element; the
second subscript always refers to its column location. Thus, component a ij is the component
located at the intersection of the ith raw and jth column.

The number of rows (m) & the number of columns (n) of the array give its order or its
dimension, M x n (reads “M” by “n”)
Eg. The following are examples of matrices

1 7 element a12 = 7
A= 5 3 this is 3 x 2 matrix a21 = 5
4 2 a32 = 2

X= 1 5 9 15 This is a 4 x 4 matrix
2 6 10 20 Element X44 = 45
3 7 11 30 X34 = 30

Page | 2
 4 8 12 45 X42 = 8
X32 = 7
2.2. Dimensions &Types of Matrices

There are deferent types of matrices. These are

1. Vector matrix – is a matrix, which consists of just one row or just one column. It is an mx
1 or 1 x n matrix.
i. Row vector is a 1 x n matrix i.e. a matrix with 1 row

eg. W = -1 0 6 1x3
ii. Column vector:
vector: is an m x 1 matrix i.e. a matrix with one column only
eg. 0
Z= 20
5 3x1
2. Square matrix:
matrix: - a matrix that has the same number of rows & columns. It is also called n-th
order matrix
eg. 2 x 2 , 3 x 3, nxn X= 1 2
3 4 2x2

3. Null or zero Matrix: - is a matrix that has zero for every entry.
It’s generally denoted by Om x n eg. Y = 0 0
0 0

4. Identity (unit) matrix: - a square matrix in which all of the primary diagonal entries are
ones & all of the off diagonal entries are zeros. Its denoted by I.

eg. I2 = 1 0 1 0 0 0
0 1 2x2 I2 = 0 1 0 0
0 0 1 0
0 0 0 1 4x4

Page | 3
N.B.
N.B. Each identity matrix is a square matrix
* Primary diagonal represents: a11, a22, a33, a44---------ann entries element
A x I = A & I x A = A that is, the product of any given matrix & the identity matrix
is the given matrix itself. Thus, the identity matrix behaves in a matrix multiplication like
number 1 in an ordinary arithmetic.

5. Scalar matrix: - is a square matrix where elements on the primary diagonal are the
same.
“ An identity matrix is a scalar matrix but a scalar matrix may not be an identity
matrix”.

2.3. Matrix operations and Techniques (Addition, Subtraction, Multiplication)

1. Matrix Addition/ Subtraction

Two matrices of the same dimension are said to be conformable for addition. Adding
corresponding elements from the two matrices & entering the result in the same raw-column
position of a new matrix perform the addition.

If A & B are two matrices, each of site m x n, then the sum of A & B is the m x n matrix C
whose elements are:

Cij = aij +bij for i = 1, 2 --------m C11 = a11 + b11

j = 1, 2 ---------n C22 = a22 + b22
C12 = a12 + b12 etc

eg. 1 3 7 9 8 12
2 4 + 8 -10 = 10 –6

eg. –2 7 2 8 7 These two matrices aren’t

4 6 9 + 6 4 = conformable for addition

Page | 4
 because they aren’t of the same
dimension.
Laws of matrix addition
The operation of adding two matrices that are conformable for addition has these two basic
properties.

1. A + B = B + A  The commutative law of matrix addition

2. (A + B) + C = A + (B + C)  the associative law of matrix addition

 The laws of matrix addition are applicable to laws of matrix subtraction, given
that the two matrices are conformable for subtraction A – B = A + (-B)

eg. A= 1 2 B= 0 1
3 4 2 5

A–B= 1 1
1 -1
2. Matrix Multiplication

a) By a constant (scalar multiplication)

A matrix can be multiplied by a constant by multiplying each component in the

matrix by a constant. The result is a new matrix of the same dimension as the
original matrix.
If K is any real number & A is an M x n matrix, then the product KA is defined to
be the matrix whose components are given by K times the corresponding
component of A; i.e.

KA = Kaij (m x n)

eg. If X = 6 5 7 , then 2X = (2 x 6) (2 x 5) (2 x 7)
2X = 12 10 14

Page | 5
Laws of scalar multiplication
The operation of multiplying a matrix by a constant (a scalar) has the following basic properties.
If X & Y are real numbers & A & B are m x n matrices, conformable for addition, then

1. XA = AX 3. X (A + B) = XA + XB
2. (X + Y) A = XA + YA 4. X (YA) = XY (A)

Laws of scalar multiplication

eg. Given matrices A & B and two real numbers X & Y

A= 1 2 3 B= 4 2 1
4 5 6 3 0 5

X =2 Y=4

1) XA = AX
Proof: XA = 2 1 2 3 AX = 1 2 3 2
4 5 6 4 5 6

XA = 2 4 6 AX = 2 4 6
8 10 12 8 10 6
[

Therefore XA = AX

2) (X + Y) A = (XA + YA)
Proof:
 (X + Y) A means first add X with Y and then multiply the result by matrix A.
The result of X + y is (2 + 4) = 6 then 6 will be multiplied by matrix A

6 1 2 3 becomes 6 12 18

Page | 6
 4 5 6 24 30 36
Therefore (X + Y) A = 6 12 18
24 30 36

 XA + YA means multiply the constant numbers X and Y with matrix A

independently, then add the two results together
XA = 2 1 2 3 YA = 4 1 2 3
4 5 6 4 5 6

XA = 2 4 6 YA= 4 8 12
8 10 12 16 20 24

Then add the result XA with YA

XA + YA = 2 4 6 + 4 8 12
8 10 12 16 20 24

= 6 12 18
24 30 36

Therefore it is true that (X + Y) A is equal with XA + YA

3) X (A + B) = XA + XB
Proof:
 X (A + B) means add matrix A and B first and then multiply the result by a constant X

Given constant number X = 2 matrices A and B then the result of X (A + B) will be

A= 1 2 3 B= 4 2 1 A+B= 5 4 4
4 5 6 3 0 5 7 5 11
X (A + B) = 2 5 4 4
Page | 7
 7 5 11

= 10 8 8
14 10 22

 XA + XB means multiply matrices A and B by a constant number X independently

then add the results

XA = 2 1 2 3 XB = 2 4 2 1
4 5 6 3 0 5
XA = 2 4 6 XB= 8 4 2
8 10 12 6 0 10

Then Add XA with XB

i.e. XA + XB = 2 4 6 + 8 4 2
8 10 12 6 0 10

= 10 8 8
14 10 22

Therefore it is true that X (A + B) is equivalent with XA + XB

4) X (YA) = XY (A)
Proof:
 X (YA) means multiply the second constant number Y with matrix A first and then
multiply the first constant number X with the result.

YA = 4 1 2 3 X(YA) = 2 4 8 12
4 5 6 16 20 24

= 4 8 12 = 8 16 24

Page | 8
 16 20 24 32 40 48
 XY (A) means multiply the two constant real numbers X and Y first and multiply
the result by matrix A.
XY = 2 X 4 XY (A) = 8 1 2 3
= 8 4 5 6

= 8 16 24
32 40 48

Therefore it is also true that X (YA) = XY (A) of columns in B

[

b ) Matrix by matrix multiplication

If A & B are two matrices, the product AB is defined if and only if the number of Columns in A
is equal to the number of rows in B, i.e. if A is an m x n matrix, B should be an n x b.

If this requirement is met., A is said to be conformable to B for multiplication. The matrix

resulting from the multiplication has dimension equivalent to the number of rows in A & the
number columns in B

If A is a matrix of dimension n x m (which has m columns) & B is a matrix of dimension p x q

(which has p rows) and if m and p aren’t the same product A.B is not defined. That is,
multiplication of matrices is possible only if the number of columns of the first equals the
number of rows of the second.

If A is of dimension n x m & if B is of dimension m x p, then the product A.B is of dimension n

xp
A B
Dimension Dimension
n x m m x p

Must be the same

Dimension of A.B
nxp

Page | 9
eg. A= 2 3 4 B= -1 7
6 9 7 2x3 0 8
5 1 3x2
AB = (2x – 1) + (3 x 0) + (4 x 5) (2 x 7) + (3 x 8) + (4 x 1)
= 18 = 42
(6x – 1) + (9 x 0) + (7 x 5) (6 x 7) + (9 x 8) + (7 x 1)
= 29 = 121
 AB = 18 42
29 121
Find BA =
B= -1 7 A= 2 3 4
0 8 6 9 7 2x3
5 1
3x2
B A
3 x 2 2 x 3 result 3 x 3 matrix

conformable

BA = (-1 x 2) + (7 x 6) (-1 x 3) + (7 x 9) (-1 x 4) + (7 x 7)

=40 60 45

(0 x 2) + (8 x 6) (0 x 3) + (8 + 9) (0 x 4) + (8 x 7)
= 48 72 56

(5 x 2) + (1 x 6) (5 x 3) + (1 x 9) (5 x 4) + (1 x 7)
16 24 27

Page | 10
 BA = 40 60 45
48 72 56
16 24 27

Special properties of matrix application

1 The associative & distributive laws of ordinary algebra apply to matrix multiplication.
Given three matrices A, B & C which are conformable for multiplication,

i. A (BC) = AB (C)  Associative law, (not C (AB)

ii. A (B+C) = AB + AC  Distributive property
iii. (A + B) C = AC + BC  Distributive property

2 on the other hand, the commutative law of multiplication doesn’t apply to matrix
multiplication. For any two real numbers X & Y, the product XY is always identical to the
product YX. But for two matrices A & B, it is not generally true that AB equals BA. (in the
product AB, we say that B is pre multiplied by A & that A is post multiplied by B.)

3 In many instances for two matrices, A & B, the product AB may be defined while the product
BA is not defined or vice versa.

In some special cases, AB does equal BA. In such special cases A & B are said to be Commute.
A= 1 1 B= 2 2 AB = 4 4
1 1 2 2 4 4
2x2 2x2
BA = 4 4

4 Another un usual property of matrix multiplication is that the product of two matrices can be
zero even though neither of the two matrices themselves is zero: we can’t conclude from the
result AB = 0 that at least one of the matrices A or B is a zero matrix

Page | 11
 A= 3 0 0 B= 0 0 0 AB = 0 0 0
2 0 0 7 –10 4 0 0 0
1 0 0 8 3 2 0 0 0

5 Also we can’t, in matrix algebra, necessarily conclude from the result AB = AC that B= C even
if A  0. Thus the cancellation law doesn’t hold, in general, in matrix multiplication

eg. A= 1 3 B= 4 3 C= 1 2
-2 –6 2 5 3 4

AB = AC = 10 14 but B  C
-20 –28

2.4. The multiplicative inverse of a matrix

If A is a square matrix of order n, then a square matrix of its inverse (A -1) of the same order n is
said to be the inverse of A, if and only if A x A-1 = I = A-1 x A
Two square matrices are inverses of each other, if their product is the identity matrix.
AA-1 = A-1 A = I

Not all matrices have an inverse. In order for a matrix to have an inverse, the matrix must, first of
all, be a square matrix.

Still not all square matrices have inverse. If a matrix has an inverse, it is said to be invertible or
Non- singular.
singular. A matrix that doesn’t have an inverse is said to be singular. An invertible matrix
will have only one inverse; that is, if a matrix does have an inverse, that inverse will be unique.

Note: i. Inverse of a matrix is defined only for square matrices

ii. If B is an inverse of A, then A is also an inverse of B

Page | 12
 iii. Inverse of a matrix is unique
iv. If matrix A has an inverse, A is said to be invertible & not all. Square matrices
are invertible.

Finding the inverse of a matrix

Lets begin by considering a tabular format where the square matrix A is augmented with an
identity matrix of the same order as A / I i.e. the two matrices separated by a vertical line

Now if the inverse matrix A -1 were known, we could multiply the matrices on each side of the
vertical line by A-1 as
AA-1 / A-1 I

Then because AA-1 = I & A-1I = A-1, we would have I / A-1. We don’t follow this procedure,
because the inverse is not known at this juncture, we are trying to determine the inverse. We
instead employ a set of permissible row operations on the augmented matrix A / I to transform
A on the left of the vertical line in to an identity matrix (I). As the identity matrix is formed on
the left of the vertical line, the inverse of A is formed on the right side. The allowable
manipulations are called Elementary raw operations Elementary Row Operations : are operations
permitted on the rows of a matrix.
In a matrix Algebra there are three types of row operations

Type 1: Any pair of rows in a matrix may be interchanged / Exchange operations

Type 2:
2: a row can be multiplied by any non-zero real number / Multiple operation
Type 3:
3: a multiple of any row can be added to any other row. / Add A-multiple operation
In short the operation can be expressed as

1. Interchanging rows
2. The multiplication of any row by a non-zero number.
3. The addition / subtraction of (a multiple of) one row to /from another row

eg.1. A= 4 3 2 B= -2 6 7  interchanging

Page | 13
 -2 6 7 4 3 2 rows

2. A= 4 3 2 B= 8 6 4 Multiplying the first

-2 6 7 –2 6 7 rows by 2

3. A= 4 3 2 B= 4 3 2 multiplying the 1st row

-2 6 7 6 12 11 by 2 & add to the 2nd
row. This case there is no charge to
the first row.
Theorem on row operations
A row operation performed on product of two matrices is equivalent to row operation performed
on the pre factor matrix
AB = C

Pre factor post factor product

Matrix matrix matrix

eg. A= 1 2 3 B= 1 2 C= 9 13
2 3 4 2x3 1 1 13 19 2 x 2
2 3 3x2
2x3 3x2

Interchange row1 (R1) with row-2 (R2)

A= 2 3 4 B= 1 2 C= 13 19
1 2 3 1 1 9 13
2 3

Page | 14
Basic procedures to find the inverse of a square matrix
1. To set ones first in a column & next zeros (with in a given column)
2. To set zeros first in a matrix & next ones.

Ones first method

Find the inverse of the following matrix
A= 3 2
1 1

augment A 3 2 1 0
with the same dimension  1 1 0 1
identity matrix first

Interchange rows (row 1 with row 2)

1 1 0 1
3 2 1 0

Multiply R1 by –3 & add to R2

(-3R1 + R2) i.e. No change to R1
1 1 0 1
0 -1 1 -3
Multiply R2 by –1 = (-R2)
1 1 0 1
0 1 -1 3

Multiply R2 by –1 & add to R1 Ones first:

first: try to set ones first in a column and then
1 0 1 -2 zeros of the same column. Goes from left to right
0 1 -1 3

Page | 15
Therefore inverse of A is

A-1 = 1 –2
-1 3

Zeros first method

A= 3 2
1 1

Find inverse of A
Augmentation  3 2 1 0
1 1 0 1

-2R2 + R1
1 0 1 -2
1 1 0 1

-1R1 + R2 Therefore, inverse of A

1 0 1 -2 i.e. A-1 = 1 -2
0 1 -1 +3 -1 3

2.5. Matrix Applications

pplications

2.5.1. Solving Systems of Linear Equations

I. n by n systems
Systems of linear equations can be solved using different methods. Some are:
i. Estimation method – for two (2) variable problems (equation)
ii. Matrix method
- Inverse method
- Gaussian method

Page | 16
Inverse method:
Steps 1. Change the system of linear equation into matrix form. The result will be 3
different matrices constructed using coefficient of the variables, unknown values
and right hand side (constant) values
2. Find the inverse of the coefficient matrix
3. Multiply the inverse of coefficient matrix with the vector of constant, and the
resulting values are the values of the unknown matrix.

eg. 2X + 3Y = 4 Given this system of linear equation applying

X + 2Y = 2 inverse method we can find the unknown values.

Step 1. Change it into matrix form

- Using coefficient construct one matrix i.e. coefficient matrix

1 3 = Coefficient matrix
1 2

- Using the unknown variables construct unknown matrix & it is a column vector (a matrix
which has one column)
X = vector of unknown
Y
-Using the constant values again construct vector of constant
4 = vector of constant
2

Step 2. Find inverse of the coefficient matrix

Now we are familiar how to find an inverse for any square matrix. Assuming once first method
find the inverse for matrix 2 3
1 2

Its inverse become 2 -3

-1 2

Page | 17
Step 3. Multiply the coefficient inverse with the vector of constant
2 -3 4 = 2
-1 2 2 0

Therefore the resulting matrix that is 2 is

0

the value for the unknown variables i.e. X = 2

Y 0

Then X = 2 and Y = 0 that is unique solution

* The logic is this given three matrices, coefficient matrix, unknown matrix and vector of
constant in the following order.
AX = B A = coefficient matrix
Given this we can apply different X = vector of unknown
Operations, say multiply both sides B = vector of constant
Of the expression by A-1
A-1AX = A-1B
IX = A-1B
X = A -1B this implies that multiplying inverse of the coefficient matrix will gives us the
value of the unknown matrix

Limitations of inverse method

- It is only used whenever the coefficient matrix is square matrix
- In addition to apply the method the coefficient matrix needs to have an inverse
- It doesn’t differentiate between no solution and infinite solution cases.

Page | 18
Gaussian method
It is developed by a mathematician Karl F. Gauss (1777-1855). It helps to solve systems of linear
equations with different solution approaches i.e. unique solution, No solution and infinite
solution cases.
“n” by “n” systems

Step: 1. Change the system of linear equation into a matrix form

2. Augument the coefficient matrix with the vector of constant.
3. Change the coefficient matrix into identity form by applying elementary row
operation and apply the same on the vector of constant.
4. The resulting values of the vector of constant will be the solution or the value of the
unknown

Example: 2X + 3Y = 4
X + 2Y = 2
Step 1. Change it into matrix form

2 3 X = 4
1 2 Y 2

Coefficient unknown vector of

Matrix matrix constant

Step: 2. Augmentation
2 3 4
1 2 2

Step: 3. Change the coefficient matrix into identity form by applying elementary row operation
(use ones first method)
2 3 4
1 2 2

Page | 19
Change first the primary diagonal entry from the first row into positive one. Possible operation is
exchange row one with row two.
1 2 2
2 3 4

Next change the remaining numbers in the first column into zero, this case number 2
Now multiply the 1st row by –2 & add the result to row –2
1 2 2
0 -1 0
Then proceed to column 2 and change the primary diagonal entry i.e. –1 into 1
Multiply the 2nd row by –1 (-1R2)
1 2 2
0 1 0
Now change the remaining number with in the same column (column –2) into zero i.e. number 2

Multiply 2nd row by –2 and add the result to the 1st row
1 0 2
0 1 0

Therefore X = 2 and Y = 0

Example 2. X+Y=2
2X + 2Y = 4
Step-1
1 1 X = 2
2 2 Y 4

Step-2 1 1 2

Page | 20
 2 2 4

Multiply Row-1 by –2 & add the result to raw-1 (-2R1 + R2)

1 1 2
0 0 0

The next step is changing the primary diagonal entry in the 2 nd row to 1. But there is no possible
operation that can enable you to change it in to number 1

Therefore the implication is that you can’t go further but we can observe something from the
result. And it is implying an infinite solution case

Example 3. X+Y=5
X+Y=9

Step 1. 1 1 X = 5
1 1 Y 9

Step 2 1 1 5
1 1 9

Change the encircled number above in to zero

Multiply the first row by –1 & add the result to the 2nd row.
1 1 5
0 0 4
0 = 4 no solution

There is no possible operation that we can apply in order to change the primary diagonal entry in
the 2nd column without affecting the first column structure. Therefore stop there, but here we can
observe something i.e. it is no solution case.

Page | 21
Therefore, Gaussian method makes a distinction between No solution & infinite solution. Unlike
the inverse method

* Summarizing our results for solving an “n” by “n” system, we start with the matrix.
(A/B), & attempt to transform it into the matrix (I/C) one of the three things will result.
1. an “n” by “n” matrix with the unique solution.

eg.
1 0 0 10
0 1 0 -5
0 0 1 3

2. A row that is all zeros except in the constant column, indicating that there are no solutions,

eg. 1 0 0 3
0 1 0 -5
0 0 0 7

3. A matrix in a form different from (1) & (2), indicating that there are an unlimited number of
solutions. Note that for an n by n system, this case occurs when there is a row with all zeros,
including the constant column.

Eg. 1 0 2 5
0 1 3 -3
0 0 0 0

Reference Exercise
1. X + 2Y – 3Z = 11 2. X + Y + Z = 4 3. X + Y + Z = 4
3X + 2Y + Z = 1 5X – Y + 7Z = 25 5X – Y + 7Z =20
2X + Y - 5Z = 11 2X – Y + 3Z = 8 X – Y + 3Z = 8
Unique solution case * No solution case * Many solution case
i.e X = -1

Page | 22
 Y=3
Z=2

4. 2X + 6Y – Z = 18
Y + 3Z = 9
3X – 5Y + 8Z = 4 X = 1, Y = 3, Z = 2
II M by n linear systems
The m x n linear systems are those systems where the number of rows (m) and number of
columns (n) are unequal or it is the case where the number of equations (m) & the number of
variables (n) are unequal. And it may appear as m > n or m < n.
Linear equation where m > n
To solve an m by n system of equations with m > n, we start with the matrix (A/B) and attempt
to transform it into the matrix (I/C).

One of the three things will result:

1. An m by n identifying matrix above m – n bottom rows that are all zeros, giving the unique
solution:

1 0 0 3 3X1 + 2X2 + X3 = 23
0 1 0 -5 X1 + 3X2 + 2X3 = 26
0 0 1 4 2X1 + X2 + 2X3 = 10 3, 5, 4
0 0 0 0 4X1 + 5X2 + 3X3 = 49

2. A row that is m – n bottom raw is all zeros except in the constant column, indicating that there
are no solutions

eg. 1 0 0 3 2X1 + X2 = 30
0 1 0 -5 X1 + 2X2 = 24
0 0 1 7 4X1 + 5X2 = 72
0 0 0 1

Page | 23
3. A matrix in a form different from (1) & (2), indicating that there are an unlimited
number of solutions

eg. 1 0 2 -4 3X1 + 2X2 + X3 = 6

0 1 3 8 6X1 + 4X2 + 3X3 = 12
0 0 0 0 9X1 + 6X2 + 3X3 = 18
0 0 0 0 15X1 + 10X2 + 5X3 = 30

Linear Equations where m < n

Our attempts to transform (A/B) into (I/C) in the case where m < n will result in:

1. A raw which is all zeros except in the constant columns, indicating that there are no solutions,
or

2. A matrix in a form different from number one above indicating that there are an unlimited
number of solutions.
“Every system of linear equations has No solution, exactly one Solution or infinitely
many solutions.”
solutions.”

Example: Solve the following systems of linear equations

1) 4X1 + 6X2 – 3X3 = 12
6X1 + 9X2 – 9/2X3 = 20
No solution
X1 + 3X2 + X3 = 6
-X1 + X2 + X3 = 2
Unlimited solution
2X1 + 3X2 + 4X3 + X4 = 37
X1 + 2X2 + 3X3 + 2X4 = 24
3X1 + X2 + X3 + 3X3 = 33

Page | 24
 Unlimited solution

Solution for an “n” by “n” system

1. 1 2 -3 11 2. 1 1 1 4
3 2 1 1 5 -1 7 25
2 1 -5 11 2 -1 3 8
-3R1+R2 / -2R1+R3 –5R1 + R2 / -2R1 + R3
1 2 -3 11 1 1 1 4
0 -4 10 -32 0 -6 2 5
0 -5 4 -22 0 -3 1 0
-1/4 R2 / -2 R2 + R1 / 3 R2 + R3 -1/6 R2 / -R2+R1 / 3 R2 + R3

1 0 2 -5 1 0 4/3 13/2
0 1 -5/2 8 0 1 -1/3 –5/6
0 0 -13/2 13 0 0 0 -5/2

-2/13 R3 / 5/2 R3 + R2 / -2 R3 + R1 this implies No solution case

1 0 0 -1
0 1 0 3
0 0 1 -2
3) 1 1 1 4
1 0 0 X -1 5 -1 7 20
0 1 0 Y = 3 2 -1 3 8
0 0 1 Z -2 –5R1 + R2 / -2R1 + R2

X = -1
Y 3 1 1 1 4
Z –2 0 -6 2 0
X = -1 Y = 3 Z = -2 0 -3 1 0
-1/6 R2 / 3 R2 + R3 / -R2 + R1

Page | 25
 1 0 4/3 4
0 1 -1/3 0
0 0 0 0
This implies that there are so many or infinite solution

“m” by “n” systems

1) 3 2 1 23 2) 2 1 30
1 3 2 26 1 2 24
2 1 2 19 4 5 72
4 5 3 49 R1 R2 / -2R1 + R2 / -4R1 + R3
R1 R2 / -3R1 + R2 / -2R1+R3 / -4R1 + R4 1 2 24
1 3 2 26 0 -3 -18
0 -7 -5 -55 0 -3 -24
0 -5 -2 -33
0 -7 -5 -55
-1/7 R2 / -3R2+R1 / 5R2 + R3 / 7R2 + R4 -1/3 R2 / -2R2 + R1 / 3R2 + R3
1 0 -1/7 17/7 1 0 14
0 1 5/7 55/7 0 1 6
0 0 11/7 44/7 0 0 -6
7/11R3 / -5/7R3 + R2 / 1/7R3 + R1 this implies that there is no
solution which uniquely satisfy
the system
1 0 0 3
0 1 0 5 3) 3 2 1 6
0 0 1 4 6 4 3 12
0 0 0 0 9 6 3 18
15 10 5 30
Unique solution case 1/ 3R1 / -6R1 + R2 / -9R1+ R3 /
-15R1 + R4
 X1 = 3 X2 = 5 X3 = 4 1 2/3 1/3 2
0 0 1 0

Page | 26
 0 0 0 0
0 0 0 0
This implies that there are unlimited numbers of solutions

m by n system where m <n

i.e. number of equations are less than # of variables
1) 4X1 + 6X2 – 3X3 = 12
6X1 + 9X2 – 9/2X3 = 20

4 6 -3 X1 12
6 9 -9/2 X2 = 20
X3

4 6 -3 12
6 9 -9/2 20
1/4R1 / -6R1 + R2
1 3/2 –3/4 3
0 0 0 2
No solution
2) X1 + 3X2 + X3 = 6
-X + X2 + X3 = 2

1 3 1 X1 6
-1 1 1 X2 = 2
X3

1 3 1 6

Page | 27
 -1 1 1 2
1xR1 + R2
1 3 1 6
0 4 2 8
1/4R2
1 3 1 6
0 1 ½ 1/2
Infinite solution

2.5.2. Markov Chains: Concepts, Model and Solutions

This model is a forecasting model. It is probabilistic (stochastic) model. A Russian

Mathematician called Andrew Markov around 1907 develops this model.
Markov chains are models, which are useful in studying the evolution of certain systems over
repeated trials. These repeated trials are often successive time periods where the state (outcome
condition) of the systems in any particular time period can’t be determined with certainty.
Therefore, a set of transition probabilities is used to describe the manner in which the system
makes transition from one period to the next. Hence,. We can predict the probabilities of the
system being in a particular state at a given time period. We can also talk about the long run or
equilibrium or steady state.

The necessary assumptions of the chain:

1. The system condition (outcome) state in any given period depends on its state in the
Preceding period & on the transition probabilities

2. The transition probabilities are constant overtime

3. Change in the system will occur once & only once each period
eg. If it’s a week, its only once in a week
4. The transition period occurs with regularities
* if we start with days, we use the day until we reach our end.

Information flow in the analysis

Page | 28
The Markov model is based on two sets of input data
 The set of transition probabilities
 The existing or initial or current conditions or states
The Markov process, therefore, describes the movement of a system from a certain state in the
current state/time period to one of n possible states in the next stage. The system makes in an
uncertain environment, all that is known is the probability associated with any possible move or
transition. This probability is known as transition probability, symbolized by P ij. It is the
likelihood that the system which is currently in state i will move to state j in the next period.
From these inputs the model makes two predictions usually expressed as vectors.

1. The probabilities of the system being in any state at any given future time
period
2. The long run (equilibrium) or steady state probabilities.

The set of transition probabilities are necessary for both prediction (time period n, & steady
state), but the initial state is needed for only the first prediction.

Input data prediction (outcome)

Set of transition Steady states

Probabilities Or long run states

about the past

The probability of
Currently / initial The system being in
States Any sate at any give
about today time
Example
Currently its known that 80% of customers shop at store 1 & 20% shop at store 2. In reviewing a
past data suppose we find that out of all customer who shopped at store 1 in a given week 90%
remain loyal for the next week (store one again), 10% switch to store 2. On the other hand, out of
all customers who shopped at store 2, in a given week 80% remains loyal for the next week
(store 2 again), 20% switch to store 1. What will be the proportion of customers shopping at
store 1 & 2 in each of the next two weeks

Page | 29
Solution
Let S1 be the proportion of store 1
S2 be the proportion of store 2
- Initial state/current state probability matrix for store one and two will be:
V12 = (0.8 0.2)
To the next weekly shopping period
from one S1 S2 Transition probability matrix
week S1 0.9 0.1 is a square matrix such that each
shopping S2 0.2 0.8 entry indicates the prob. Of the
period system moving from a given state another state.
- The sum of rows in the transition matrix should be 1
- We have to be consistent in writing the elements
Markov Chain Formula

a) Vij (n) = Vij (n – 1) x P where P = Transition matrix

Vij (n) = Vector for period n
Vij (n – 1) = Vector for period n – 1
V12 (0) = (0.8 0.2) current share
V12 (1) = V12 (1 –1 ) x P
= V12 (0) x P
(0.8 0.2) 0.9 0.1
0.2 0.8
= (0.8 x 0.9) + (0.2 x 0.2) (0.8 x 0.1) + (0.2 x 0.8)
= 0.72 + 0.04 0.08 + 0.16
= 0.76 0.24
V12 (1) = (0.76 0.24)
V12 (2) = V12 (2 – 1) x P
= V12 (1) x P
(0.76 0.24) 0.9 0.1
0.2 0.8
(0.76x 0.9) + (0.24 x 0.2) 0.76 (0.1) + (0.24 x 0.8)
(0.732 0.268)
Page | 30
b) Long run market share

Assumption

In the log run the share of the systems is assumed to be constant.

Let - the share of store 1 in the long run be V1
- the share of store 2 in the long run be V2

n p n+1
(V1 V2) 0.9 0.1 = (V1 V2)
0.2 0.8
0.9V1 + 0.2V2 = V1
0.1V1 + 0.8V2 = V2
-V1 + 0.9V1 + 0.2V2 = 0
0.1V1 + 0.8V2 – V2 = 0
-0.1V1 + 0.2V2 = 0
0.1V1 + (0.2V2) = 0

0.9V1 + 0.2 (V2 – V1) = V1

0.9V1 + 0.2 – 0.2V1 = V1
0.7V1 + 0.2 = V1
0.2 = 0.3V1
V1 = 2/3
V2 = 1 – V1
= 1 – 2/3
V2 = 1/3

In the long run 67% of the customers will shop in store 1 & 33% in shop 2.

Prediction:
Long run: only the transition matrix

Page | 31
= At specified time:-
time:- the transition matrix & state vector. Hence unless the transition matrix is
affected, the long run state will not be affected. Moreover, we can’t know the number of years,
weeks to attain the long run state / point but we can know the share.

2.6. Summary

A matrix is a rectangular array of real numbers arranged in m rows & n columns. It is

symbolized by a bold face capital letter enclosed by a bracket or parentheses.

There are deferent types of matrices. These are: Vector matrix, Square matrix, Null or zero
matrix, Identity (unit) matrix, Scalar matrix

Two matrices of the same dimension are said to be conformable for addition. Adding
corresponding elements from the two matrices & entering the result in the same raw-column
position of a new matrix perform the addition

If A is a square matrix of order n, then a square matrix of its inverse (A -1) of the same order n is
said to be the inverse of A, if and only if A x A-1 = I = A-1 x A

Markov chains are models, which are useful in studying the evolution of certain systems over
repeated trials.
1. grade carpeting requires 20 sq. yards of wool & 40sq. yards of nylon. Each roll of quality-
grade carpeting requires 30 square yards of wool & 30 square yard of nylon. If Kebede
would like to use all the material in inventory, how many rolls of superior & how may rolls
of quality carpeting should be manufactured?

2. Getahun invested a total of br. 10000 in three different saving accounts. The accounts paid
simple interest at an annual rate of 8%, 9% & 7.5% respectively. Total interest earned for the
year was br. 845. The amount in the 9% account was twice the amount
invested in the 7.5% account. How much did Getahun invest in each account

Page | 32
3. A division of the ministry of public health has conducted a simple survey on the public
attitude towards smoking . From the results of the survey the department concluded
that currently only 20% of the population smokes cigarette & every month 10% of non-
smokers become smokers where as 5% of smokers discontinue smoking.
Required:
Required:
1. Write the current & transition matrices
2. What will be the proportion of the non-users (non-smokers) & users (smokers) in the
long run
4. A population of 100,000 consumers make the following purchases during a particular week:
20000 purchase Brand A, 35,000 Brand B & 45000 purchase neither Brand. From a market
study, it is estimated that of those who purchase Brand A, 80% will purchase it again next
week, 15% will purchase brand B next week, & 5% will purchase neither brand. Of those
who purchase B, 85% will purchase it again next week, 12% will purchase brand A next
week, & 3% will purchase neither brand. Of those who purchase neither brand, 20% will
purchase A next week, 15% will purchase Brand B next week, & 65% will purchase neither
brand next week. If this purchasing pattern continues, will the market stabilize?? What will
the stable distribution be?
Yes. The share of A, B and C is = (0.4 0.5 0.1) respectively

5. A vigorous television advertising campaign is conducted during the football reason to

promote a well-known brand X shaving cream. For each of several weeks, a survey is made
& it is found that each week 80% of those using brand X continue to use it & 20% switch. It
is also found that those not using brand X, 20% switch to brand X while the other 80%
continue using another brad.

a) Write the transition matrix, assuming the transition percentage continue to hold for
succeeding weeks.

b) If 20% of the people are using brand X at the start of the advertising campaign,
what percentage will be brand X 1week later? Two weeks later?

Page | 33
 Answer Key to Self Test Exercises

1. D Ch T Cb
Mt 50 20 15 25 5 Desk
Lab. 30 15 12 15 6 Chair
FOH 30 15 8 20 4 Tables
12 Cabinet

Material cost = (50 x 5) + (20 x 6) + (5 x 4) + (25 x 12)

= 730 br.
Labor cost = (30 x 5) + (15 x 6) + (12 x 4) + (15 x 12)
= $ 468.00
FOH cost = (30 x 5) + (15 x 6 ) + (8 x 4) + (20 x 12)
= $ 1710.00

2. Given: wool inventory 1500 yards

nylon inventory 1800 yards
Grade one carpet The other grade carpet
Wool requirement
per roll 20 Sq. 30 Sq.
Nylon requirement
per roll 40 Sq. 30 Sq.

Let X be rolls of superior grade carpeting &

Y be rolls of quality grade carpeting
20 30 X 1500 20 30 1500
40 30 Y = 1800 40 30 1800

2 3 150
20X + 30Y = 1500 4 3 180

Page | 34
 40X + 30Y = 1800 1/2 R1 / -4R1 + R2
-20X = -300
X = 15 1 3/2 75
0 -3 -120
20X + 30Y = 1500 –1/3 R2/ -3/2 R2 + R1
20 (15) + 30Y = 1500 1 0 15
30Y = 1500 – 300 0 1 40
Y = 1200
30
Y = 40 X = 15 & Y = 40

3. Total investment 10000.00

interest earned from the three accounts 8%, 9% and 7.5%
total interest earned for the year was 845.00
amount in 9% = 2 (amount in 7.5%)

Let Amount invested in 8% account be X1

Amount invested in 9% account be X2
Amount invested in 7.5% account be X3

X1 + X2 + X3 = 10,000
0.08X1 + 0.09X2 + 0.075X3 = 845
X2 = 2(X3)
or

X1 + X2 + X3 = 10,000
0.08X1 + 0.09X2 + 0.075X3 = 845
X2 – 2X3 = 0

1 1 1 10,000

Page | 35
 80 90 75 845,000
0 1 -2 0
-80R1 + R2

1 1 1 10,000
0 10 -5 45,000
0 1 -2 0
1/10R2 -R2 + R1 -R2 + R3

1 0 3/2 5500
0 1 -1/2 4500
0 0 -3/2 -4500
-2/3 R3 ½ R3 ½ R3 + R2 -3/2 R3 + R1

1 0 0 1000
0 1 0 6000
0 0 1 3000
X1 = 1000,
1000, X2 = 6000,
6000, X3 = 3000

4.
1) Let U – stands for Smokers
N – Stands for non-Smokers

Initial state VUN (0) = (0.2 0.8)

To the next month

Smokers Non smokers

Page | 36
 From Smokers 0.95 0.05 P = .95 .05
one month Non-smokers 0.10 0.90 .10 .90
2). VUN(1) = VUN(0) x P VUN(2) = VUN(1) x P
= (0.2 0.8) .95 .05 = (.27 .73) . .95 .05
.10 .90 .10 .90

= ( 0.27 0.73) = (0.3295 0.6705)

5. Given: 20,000 purchase brand A

35,000 purchase brand B
45,000 purchase neither brand
Total consumers = 100,000 (20,000 + 35,000 + 45,000)

Let VA represents the share of brand A purchasers

VB represents the share of Brand B purchasers
VN represent the share of neither brand purchasers

The system is arranged in a weekly basis

To the next week shopping period
From A B N
One week A 0.80 0.15 0.05
Shopping B 0.12 0.85 0.03 = P
Period N 0.20 0.15 0.65
The stable market means the long run or steady state market because it is noted that in the long
run the share will be stable.
And in the long run we have said that the share at n period is equal with the share at n + 1 period.
Therefore
(The share at n period) x (the transition probabilities) = (the share at n + 1 period)
Let the share of brand A purchasers be V1 in the long run
the share of brand B purchasers be V2 in the long run
the share of neither purchasers be V3 in the long run
Then (V1 V2 V3) 0.80 0.15 0.05

Page | 37
 0.12 0.85 0.03 = (V1 V2 V3)
0.20 0.15 0.65

0.8V1 + 0.12V2 + 0.2V3 = V1

0.15V1+ 0.85V2 + 0.15V3 = V2
0.05V1 + 0.03V2 + 0.65V3 = V3
V1 + V2 + V3 = 1
Therefore V1 = 1 – V2 – V3
Substitute 1 – V2 – V3 in place of V1 to reduce your system in to two variable case
Take the first equation
0.8V1 + 0.12V2 + 0.2V3 = V1
0.8 (1- V2 – V3) + 0.12V2 + 0.2V3 = 1 – V2 – V3
0.8 – 0.8V2 – 0.8V3 + 0.12V2 + 0.2V3 + V2 + V3 = 1
Add similar variables together
0.32V2 + 0.4V3 = 1- 0.8
0.32V2 + 0.4V3 = 0.2 this is a summarized equation from the first equation. And do the
same for the second equation.
0.15V1 + 0.85V2 + 0.15V3 = V2
0.15 (1 – V2 – V3) + 0.8V2 + 0.15V3 = V2
0.15 – 0.15V2 – 0.15V3 + 0.85V2 + 0.15V3 = V2

Add together similar variables and take the constant values to the right side.
-0.3V2 = -0.15
V2 = -0.15
-0.30
V2 = 0.5 this implies the long run share for the purchasers of brand B will be
50%. Then using this value and the first summarized equation (0.32V2 + 0.4V3 = 0.2)

Find the value of V3 in the long run

That is, 0.32 (0.5) + 0.4V3 = 0.2
0.16 + 0.4V3 = 0.2
0.4V3 = 0.20 – 0.16

Page | 38
 V3 = 0.04
0.04 = V3 = 0.1
This implies the share of neither brand purchases in the long run will be 10%. Hence the share of
Brand A purchasers will be 0.4 (1 – 0.5 – 0.1)

Because we said above V1 = 1 – V2 – V3

Therefore V1 = 1 – 0.5 – 0.1
V1 = 0.4

That is the long run share of Brand A purchasers will be 40% of the total population
i.e. VA VB VN = (0.4 0.5 0.1)

6. A) let X be the proportion of brand X users

X1 be the proportion of other brand users

To the next week

Shopping period

From this X X1
Week X 0.80 0.20 =P
Shopping X1 0.20 0.80
period
B) Current users of brand X = 20% then, the users of other brand will be 80%
VXX1 (0) = (0.20 0.80)
VXX1 (1) = VXX1 (0) P
= (0.20 0.8) 0.80 0.20
0.20 0.80
= (0.32 0.68)
The proportion of brand X and other brand users after one week period is expected to be 32%
and 68% respectively. Then the expected users in the 2nd week will be
VXX1 (2) = VXX1 (2 – 1) (P)
= VXX1 (1) P
= (0.32 0-.68) 0.80 0.20

Page | 39
 0.20 0.80
= 0.392 0.608
The expected share of brand X and other brand users is 39.2% and 60.8% in the second week.

? Review Questions

.
1. A certain manufacturer produces two product P & q. Each unit of product P requires (in its
production) 20 units of row material A & 10 units of row material B. each unit of product of
requires 30 units of raw material A & 50 units of raw material B. there is a limited supply of
1200 units of raw material A & 950 units of raw material B. How many units of P & Q can
be produced if we want to exhaust the supply of raw materials?

2. Attendance records indicate that 80,000 South Koreans attended the 2002 world cup at its
opening ceremony. Total ticket receipts were Birr 3,500,000. Admission prices were Birr
37.5 for the second-class and Birr 62.50 for the first class. Determine the number of South
Koreans who attended the football game at first class and second class.

Page | 40