1: What is a correct definition of a tree?
n
n-1
2: Which algorithm solves the minimal cost network flow problems?
3: Consider the minimal cost network flow for a connected graph with 100 nodes and 1001 links. What is the rank of the incidence matrix for this problem?
100
1001
99
1000
4: Consider the following network:
The supply vector b has the values:
b
What is a legitimate initial solution to start the network algorithm?
x12 = x13 = x24 = x34 = 1
x12 = x34 = 2, x13 = x24 = 0
x12 = x24 = 2, x13 = x34 = 0
x12 = x13 = x24 = x34 = 0, x14 = 2
5: Consider the following network:
The cost coefficients are
Give a reason why the network should be modified before the use of the network algorithm.
cij
Your Results: