F

feasibility version (of optimization problem) 62 feasible assignment 134 feasible direction 87 feasible direction method 87 feasible relation 40, 43, 46, 48, 49, 66,

114, 162,163 feasible schedule 17, 31, 66, 137

- with respect to assignment 134 feasible set 19

- maximal 19 feasible solution 135 feasible start time 111 feedback mechanism f49 Fibonacci heap 72, 93 fictitious activity 8

flattest ascent algorithm 95, 102 flattest ascent direction problem 95 flattest feasible ascent direction 94 float

- early free 16,161

- total 15

flow network 43 forbidden set 7,19, 33, 77

- breaking up 22, 36

- minimal 19, 33 forest 9f forward arc 109, 111, 116,157

full assignment 133

function see also objective function

- additional-cost 113,119

- Bouligand-differentiable 90

- continuously differentiable 86

- lower semicontinuous 9,17, 55

- neighborhood 115

- net present value 157, 158, 160

- positively homogeneous 87

- subadditive 90

- sublinear 87, 90

- sum-separable 85, 86 G

general interval capacity test 27 general product structure 146 genetic algorithm 78 gozinto graph 142 gross requirements 143, 147

Was this article helpful?

0 0

Post a comment