Professional Documents
Culture Documents
Lecture 17
Network flow optimization
total unimodularity
examples
171
Networks
7
4 5
4
1 2 6
3
1 5 6
8 3
2
1 1 0 0 0 0 0 1
1 0 1 0 0 0 0 1
0 1 1 1 1 1 0 0
A=
0 0 0 1 0 0 1 0
0 0 0 0 0 1 1 0
0 0 0 0 1 0 0 0
flow vector x Rn
xj : flow (of material, traffic, charge, information, . . . ) through arc j
positive if in direction of arc; negative otherwise
n
X
Aij xj = (Ax)i
j=1
Aik = 1
xj xk
Aij = 1
i
supply vector b Rm
bi is external supply at node i (negative bi represents external demand)
must satisfy 1T b = 0 (total supply = total demand)
Aik = 1
xj xk
Aij = 1
i
bi
balance equations:
Ax = b
minimize cT x
subject to Ax = b
lxu
maximize flow from node 1 (source) to node m (sink) through the network
t 1 m t
maximize t
subject to Ax = te
lxu
where e = (1, 0, . . . , 0, 1)
1 m
artificial arc n + 1
minimize t
x
subject to A e =0
t
lxu
total unimodularity
examples
Totally unimodular matrix
examples
the matrix
1 0 1 0 1
0 1 1 1 1
0 0 0 1 1
consider a k k submatrix B of A
Ax = b, lxu
where
A is totally unimodular
b is an integer vector
the finite lower bounds lk and finite upper bounds uk are integers
minimize cT x
subject to Ax = b
lxu
x Zn
minimize cT x
subject to Ax = b
lxu
total unimodularity
examples
Shortest path problem
shortest path in directed graph with node-arc incidence matrix A
(forward) paths from node 1 to m can be represented by vectors x with
minimize 1T x
subject to Ax = (1, 0, . . . , 0, 1)
x {0, 1}n
LP formulation
minimize 1T x
subject to Ax = (1, 0, . . . , 0, 1)
0x1
N
X N
X
Xij = 1, j = 1, . . . , N, Xij = 1, i = 1, . . . , N
i=1 j=1
example (N = 3)
LP formulation
N
P
minimize Aij Xij
i,j=1
PN
subject to Xij = 1, j = 1, . . . , N
i=1
N
P
Xij = 1, i = 1, . . . , N
j=1
0 Xij 1, i, j = 1, . . . , N