270
Subject
Index
Input-output relationships
MD river basin system, 113
optimal expansion water resources
model, 135-136
Integer programming, see also Branch and
bound algorithms (BBA), Little's
branch and bound
algorithm
(LBBA)
general format, 69-70
mixed integer programming, 66, 67
typical examples of, 70-71
use of the partial enumeration algorithm
in, 71-74
Interest rate
MD river basin system, 64
selection, 33
variation in the sensitivity analysis of
the MD river basin, 136-138
Irrigation, see also Constraints, irrigation
benefits, example of calculation of, 46-47
data sources, 59, 60
demand schedule for MD river basin
system, 114
as example of withdrawal-consumptive
use of water, 109
as objective of the MD river basin system, 109, 112
revenue coefficients, 46-47, 60
water supply and capital cost of canals
and related structures, 32
Irrigation water consumptive data, calculation of, 60-61
Κ
Knapsack problem, 71
L
Lagrange multiplier technique, see Nonlinear programming
Latin America
availability of hydroelectric energy, 62
examples of water resources projects, 6
hydrological data sources, 62
municipal and industrial use of water, 62
Linear programming, 17-21, see also
Minimum cost circulation problem
dual problem, 19
examples in water resources management problems, 17
general format, 18-19
O.P. problem of the simpler water
quality problem, solution of, 156
primal problem, 19
water resources investment problem
solution, 20-21
Little's branch and bound algorithm
(LBBA), 74-83
backtracking sequence, 80
bound calculations, 74
branching rules, 75
capital budgeting (CB) problem solution, 80-83
CB problem of the MD river basin,
solution of, 117-122, 126-127
traveling salesman problem solution,
75-80
Μ
Machine job-shop scheduling problem, 70
Mathematical models, see also Optimal
expansion of an existing water resources
system,
Optimization
techniques
allowance for uncertainty, 139-141
applicability to decision techniques, 12
as phase of systems analysis, 9, 11
sensitivity analysis, 133-136
Maule River Basin, some geographical
and economic aspects of, 106
MD river basin system
decision tree for first two feasible solutions, 119
design variables, 106-108
features excluded, 38-40, 109
inflow hydrology, 106, 112-114
information flow diagram for inputs and
outputs, 113
network configuration, 107
operating procedure, 106-109, 123-127
penalty function, 137
results of optimization study, 122-126
sensitivity analysis of, 136-138
Minimum cost circulation problem, 86-88,
see also Out-of-kilter algorithm
(OKA)
example, 89
Subject
Index
Input-output relationships
MD river basin system, 113
optimal expansion water resources
model, 135-136
Integer programming, see also Branch and
bound algorithms (BBA), Little's
branch and bound
algorithm
(LBBA)
general format, 69-70
mixed integer programming, 66, 67
typical examples of, 70-71
use of the partial enumeration algorithm
in, 71-74
Interest rate
MD river basin system, 64
selection, 33
variation in the sensitivity analysis of
the MD river basin, 136-138
Irrigation, see also Constraints, irrigation
benefits, example of calculation of, 46-47
data sources, 59, 60
demand schedule for MD river basin
system, 114
as example of withdrawal-consumptive
use of water, 109
as objective of the MD river basin system, 109, 112
revenue coefficients, 46-47, 60
water supply and capital cost of canals
and related structures, 32
Irrigation water consumptive data, calculation of, 60-61
Κ
Knapsack problem, 71
L
Lagrange multiplier technique, see Nonlinear programming
Latin America
availability of hydroelectric energy, 62
examples of water resources projects, 6
hydrological data sources, 62
municipal and industrial use of water, 62
Linear programming, 17-21, see also
Minimum cost circulation problem
dual problem, 19
examples in water resources management problems, 17
general format, 18-19
O.P. problem of the simpler water
quality problem, solution of, 156
primal problem, 19
water resources investment problem
solution, 20-21
Little's branch and bound algorithm
(LBBA), 74-83
backtracking sequence, 80
bound calculations, 74
branching rules, 75
capital budgeting (CB) problem solution, 80-83
CB problem of the MD river basin,
solution of, 117-122, 126-127
traveling salesman problem solution,
75-80
Μ
Machine job-shop scheduling problem, 70
Mathematical models, see also Optimal
expansion of an existing water resources
system,
Optimization
techniques
allowance for uncertainty, 139-141
applicability to decision techniques, 12
as phase of systems analysis, 9, 11
sensitivity analysis, 133-136
Maule River Basin, some geographical
and economic aspects of, 106
MD river basin system
decision tree for first two feasible solutions, 119
design variables, 106-108
features excluded, 38-40, 109
inflow hydrology, 106, 112-114
information flow diagram for inputs and
outputs, 113
network configuration, 107
operating procedure, 106-109, 123-127
penalty function, 137
results of optimization study, 122-126
sensitivity analysis of, 136-138
Minimum cost circulation problem, 86-88,
see also Out-of-kilter algorithm
(OKA)
example, 89