|
Электронная библиотека Попечительского совета механико-математического факультета Московского государственного университета
|
|
|
|
|
Fogiel M. - The Operations Research Problem Solver |
|
|
Предметный указатель |
Absorbing state 13-45 13-46
Activity duration, most likely 8-31
Activity duration, optimistic 8-31
Activity duration, pessimistic 8-31
Activity, critical 8-32
Activity, dummy 8-1 8-33
Algorithm, cuts 6-37
Algorithm, Dijkstra's 8-8 8-12 8-13
Algorithm, dual simplex 4-4 to 4-13 4-29 4-30 6-16 6-17 6-26
Algorithm, Ford - Fulkerson 8-21 8-22
Algorithm, forward recursive 12-35
Algorithm, fractional 6-25
Algorithm, greedy 8-15 8-16 8-35
Algorithm, Hildreth's 11-18
Algorithm, Ignall - Schrage's 8-38
Algorithm, Johnson's 8-36 8-37
Algorithm, northwest corner 5-3 to 5-9
Algorithm, simplex 3-1 to 3-55
Algorithm, Wolfe's 11-14 11-15
Alternate optima 3-28
Analysis, broad-switching 13-38
Analysis, input-output 2-15
Analysis, network 7-7 8-1
Applications, Atlantic city game 7-22
Applications, blending problem 2-12 4-3
Applications, boat manufacturing problem 4-34
Applications, cabinet maker's product mix problem 4-33
Applications, capital budgeting 6-3 6-36 7-14
Applications, electric utility expansion problem 7-13
Applications, four sided plate 2-49
Applications, industrial production 2-31
Applications, minimal spanning tree problem 8-15 to 8-18
Applications, mining problem 4-10
Applications, space project problem 7-21
Applications, traveling salesman problem 6-40 6-41
Applications, warehouse problem 7-11
Approximation, normal 12-25
Approximation, quadratic 9-24
Approximation, Vogel's 5-10 to 5-14
Arborescence 8-10 8-26
ARC 8-2 8-5 8-8 8-18 8-25 8-28 8-29
Arrival rate, mean 13-21 13-14 13-16
arrow diagrams 8-1 to 8-4 8-30
Artificial column exclusion rule 3-51
Artificial variables 3-11 3-29 3-33 3-37 3-40 3-46 4-13 4-12 4-21 4-25 4-31 4-47
Assignment problem 5-31 to 5-43
Atlantic city game 7-22
Augmented matrix 3-16
Auxiliary problem 3-44
Back order cost 12-30 12-31
Backward pass computation 8-31 8-33
Backward recursion 7-16
Barrier function method 10-44 10-45
BASIC 3-8 to 3-12 3-15
Basic feasible point see 'Basic feasible solution'
Basic feasible solution 3-8 3-9 3-11 3-15
Basic variable, primal 3-51
Basic variables 3-8 to 3-12 3- |
| | |