104
3. A Procedure for Solving the Optimal Expansion
Problem
3·5. Flow Chart of the Algorithm for Solving the Water
Resources Problem
Figures 3.14 and 3.15 describe every major step in the combined branch
and bound and out-of-kilter algorithm. Figure 3.14 shows how the capital
/
PART 2 OF
\
OPTIMIZATION
\
ALGORITHM
J
RETURN TO
(*', T-l)NODE
*—CALCULATE
Τ
ELIMINATE NODES (i)
Fig. 3.15 Flow chart of the optimization algorithm (part 2): the backtracking
sequence.
3. A Procedure for Solving the Optimal Expansion
Problem
3·5. Flow Chart of the Algorithm for Solving the Water
Resources Problem
Figures 3.14 and 3.15 describe every major step in the combined branch
and bound and out-of-kilter algorithm. Figure 3.14 shows how the capital
/
PART 2 OF
\
OPTIMIZATION
\
ALGORITHM
J
RETURN TO
(*', T-l)NODE
*—CALCULATE
Τ
ELIMINATE NODES (i)
Fig. 3.15 Flow chart of the optimization algorithm (part 2): the backtracking
sequence.