3.3. The Operational
Policy Problem (Problem
HI)
Iteration 1
Arc
X.
QU
fa
State In kilter?
(1, 2)
0
0
2
2
0 — In
A
Yes
(1, 3)
0
0
5
5
2 > In A*
No
(2, 3)
0
0
1
1
0 = Uz A
Yes
(2, 4)
0
0
3
3
2 > hi A*
No
(3, 2)
0
0
1
1
2 > hi A 2
No
(3, 4)
0
0
6
6
0
hi
At
No
(4, 1)
0
0
0
0
2
hi
Bt
No
1. Pick the first out-of-kilter arc (1, 3).
2. State of arc is A 2 ; reduce fn to In .
3. Find path from node 1 to node 3 by labeling procedure.
Labeling procedure
Node
Label
1
(3-, 2) (Node 1 is labeled)
2
Cannot be labeled; arc (1, 2) is in kilter
4
Cannot be labeled; flow decrease drives
arc (4, 1) more out of kilter
Nonbreakthrough has occurred.
X =
{2,3,4},M= {(1,2), (1,3)},Μ = Φ,Ζ) = ιηιη{2,5}
2, D = does not exist, D f = 2.
New τ values: x x = 0; τ 2 — τ ζ = x 4 = 2.
Recompute state of each arc.