25.

Show that the following matrices are or are not totally unimodular:
1 1 0 0
0 1 1 0 1 1 0 1
1 0
0 0 1 1 0 1
1 1 1 1
1 0 0 1

An integer matrix is totally unimodular if these conditions are satisfied

a) Each entry in the matrix is either 0, 1, or -1.
b) Each column of the matrix contains no more than 2 nonzero entries.
c) The rows of the matrix can be partitioned into 2 sets, such that:
- If a column has 2 nonzero elements of the same sign, both elements can be placed in
different sets.
- If a column has 2 nonzero elements of the opposite sign, both elements can be placed in
the same set.

1 1 0 0
0 1 1 0

0 0 1 1

1 0 0 1

The matrix is totally unimodular because it satisfied all condition to be total unimodular.

1 1 0 1
1 0 0 1

1 1 1 1

This matrix is not totally unimodular because there is more than 2 nonzero in column
that shown on red circle. This condition does not satisfy the condition to be totally
unimodular.
29. Consider the 4-node network corresponding to the following matrix, where the entry on the ith row
and the jth column is the probability that arc (i,j) fails:
0.3 0.7 0.9
0.1 0.3

0.3 0.5

Find the most reliable chain from node 1 to node 4. Compute the probability of success. Use
Dijkstra's algorithm.

We change the matrix value, so the matrix contain the probability of success as shown below
0.7 0.3 0.1
0.9 0.7

0.7 0.5

Dijkstra's algorithm
Step 1 2 3 4
1 [0] 0.7 0.3 0.1
2 [0] [0.7] 0.3 0.1
3 [0] [0.7] 0.63 0.49
4 [0] [0.7] [0.63] 0.49
5 [0] [0.7] [0.63] [0.49]

The most reliable chain from node 1 to node 4 is 1 2 3 4

30. Consider the network defined by the following lists:
Node 1 2 3 4
Number of Exiting Arcs 2 2 1 0

End Nodes of Arcs 2 4 3 4 4

Arc Lengths 3 2 -4 1 1

a Use Ford's algorithm to find the length of the shortest path from node 1 to node 4. Find the arcs in
the path.
b Use Floyd's algorithm to find the length of the shortest path between any two nodes. Find the arcs
in the path from node 1 to node 4.

We can draw the node as follow

Ford's algorithm
Step 1 2 3 4
1 [0] 3 2
2 [0] 3 [2]
3 [0] 3 [2]
4 [0] [3] -1 2
5 [0] [3] [-1] 2
6 [0] [3] [-1] 0
7 [0] [3] [-1] [0]
35. In the network having the net-flow coefficient matrix shown below, node 1 has a supply of four units
of flow and node 2 has a demand of one unit. (a) Draw the network showing all arc data. (b) What
kind of network is this? (c) If all supply available is used, how many units of flow will be available at
node 4 after following the path 1-3-2-4? (d) Write the flow-conservation condition for node 2.
1 1 0 0 0 0
-3 0 1 1 - 1/2 0

0 -6 -2 0 1 1

0 0 0 - 2/3 0 - 1/3