PROJECT REQUIREMENT

Linear Algebra with Computer Application

E03

Problem Set #1
Problem Set #2

By:

Pangan, Mark John Paul G.

Paz, Jose Gabriel L.
Problems Set #1:

1. The figure shows a network of one-way streets with traffic flowing in the directions
indicated. The flow rate along the streets are measured as the average number of
vehicles per hour.
a. Set-up a linear system where solution provides the unknown traffic flow rate.

Flow In = Flow Out

A: X1 + X3 = 800

B: X3 + X6 = 750

C: X1 + X4 = 200 + X2

D: X7 + 600 = X6 + X4

E: X5 + 450 = X7 + 400

F: X2 + 100 = 600 + X5

b. Solve the system for the unknown flow rate.

c. Is it possible to close the road from A to B for construction and keep traffic flowing on
the streets? Explain.

By observing A and B, we conclude that for any value of X 4 and X5 no

conjunction in system. So, A and B can be closed because equation satisfy for any
value of X4 and X5 so they can be zero which mean it can be removed.
2. Balance the chemical reaction:

CO2 + H2O  C6H12O6 + O2

X1 – 6X3 = 0

2X1 + X2 – 6X3 = 0

2X1 – 12X3 =0

Therefore, the balance equation for the given is:

6 CO2 + 6 H2O -> C6H12O6 + 6 O2

3. Find the cubic polynomial whose graph passes through the points (-1, -1), (0,1),
(1,3), and (4, -1).

Since there are three points, we will use an interpolating polynomial of degree n= 3.

P ( x ) =a0 +a 1 x +a2 x 2+ a3 x 3

X1 = -1, Y1 = -1

X2 = 0, Y2 = 1

X3 = 1, Y3 = 3

X4 = 4, Y4 = 1
 Therefore, the final answer is:

P ( x ) =1+ 2.1667 x+−0.1667 x 3

4. A company produces web design, software and networking services. View the
company as an open economy described by:

Input Requirement per Dollar Output

Web
Design Software Net Working

Web
Design 0.40 0.20 0.45
Product

Software 0.30 0.35 0.30

Networking 0.15 0.10 0.20

a. Find the consumption matrix for the company.

0.40 0.20 0.45

[
A = 0.30 0.35 0.30
0.15 0.10 0.20 ]
b. Suppose that the customers have a demand for $5400 worth of Web design, $2700
worth of Software, and $900 worth of networking. Use row reduction to find a
production vector that will meet this demand exactly.
 0.40 0.20 0.45 x1 5400

[
A = 0.30 0.35 0.30 ,
0.15 0.10 0.20 ] []
x = x2 ,
x3 [ ]
d = 2700
900

Therefore, this tells us that the result is consistent, and the production will not
meet the demand of the open economy exactly because the demand by producing -
$43,148 worth of Web design output, -$52,450 worth of Software, -$27,043 work of
Networking.
Problem Set #2:
1. A country is divided into three demographic regions. It is found that each year 5% of
the residents of region 1 move to region 2, and 5% move to region 3. Of the residents
of region 2, 15% move to region 1 and 10% move to region 3. And of the residents of
region 3, 10% move to region 1 and 5% move to region 2. What percentage of the
population resides in each of the three regions after a long period of time?

0.90 0.15 0.10

[
P = 0.05 0.75 0.05
0.05 0.10 0.85 ]
We need to find the steady state vector q among the eigenvectors corresponding to
eigenvalue.

Using the eigenvectors correspond to eigenvalue 1.

0.90 0.15 0.10 1 −1.5 −1.0 1 −3.25 0

[
P = 0.05 0.75 0.05
0.05 0.10 0.85 ] [ ~ 0 0.175 −0.1
0 0 0 ] [
~ 0 −1.75 1
0 0 0 ]
To obtain the steady state vector, note that q is a probability vector. We choose t
such that (3.25 + 1 + 1.75)t = 1 which will give t = 1/6, and q = (0.54167, 0.16666,
0.29167), an eigenvector which is also a probability vector.
 Therefore, after a long period of time, 54.17% of the population reside in region 1,
16.46% and 29.16% reside in Regions 2 and 3 respectively.

2. A mouse is placed in a box with nine rooms as illustrated in the figure below.

Assume that, at regular intervals of time, it is equally likely that the mouse will decide
to go through any door in the room or stay in the room.

A. Construct the 9×9 transition matrix for this problem and show that it is regular.

1/3 1/4 0 1/4 0 0 0 0 0

[ ]
1/3 1/4 1/3 0 1/5 0 0 0 0
0 1/4 1/3 0 0 1/ 4 0 0 0
1/3 0 0 1/4 1/5 0 1/3 0 0
P= 0 1/4 0 1/4 1/5 1/ 4 0 1/4 0
0 0 1/3 0 1/5 1/ 4 0 0 1/3
0 0 0 1/4 0 0 1/3 1/4 0
0 0 0 0 1/5 0 1/3 1/4 1/3
0 0 0 0 0 1/ 4 0 1/4 1/3

B. Determine the steady-state vector for this matrix.

Each of the element in V can be converted to a rational number. What we have
for our final answer is:

1/11

[]
4 / 33
1/11
4 / 33
V = 5/33
4 / 33
1/11
4 / 33
1/11