Preface |
|
xi | |
|
1 Introduction To Operations Research |
|
|
1 | (20) |
|
1.1 What is Deterministic Operations Research? |
|
|
1 | (4) |
|
1.2 Introduction to Optimization Modeling |
|
|
5 | (8) |
|
1.3 Common Classes of Mathematical Programs |
|
|
13 | (5) |
|
|
18 | (1) |
|
|
19 | (2) |
|
2 Linear Programming Modeling |
|
|
21 | (64) |
|
2.1 Resource Allocation Models |
|
|
21 | (4) |
|
2.2 Work Scheduling Models |
|
|
25 | (3) |
|
|
28 | (2) |
|
|
30 | (6) |
|
2.5 Production Process Models |
|
|
36 | (6) |
|
2.6 Multiperiod Models: Work Scheduling and Inventory |
|
|
42 | (4) |
|
2.7 Linearization of Special Nonlinear Models |
|
|
46 | (5) |
|
2.8 Various Forms of Linear Programs |
|
|
51 | (5) |
|
|
56 | (12) |
|
|
68 | (17) |
|
3 Integer And Combinatorial Models |
|
|
85 | (41) |
|
|
85 | (7) |
|
|
92 | (2) |
|
3.3 Models Using Logical Constraints |
|
|
94 | (5) |
|
|
99 | (10) |
|
3.5 Sports Scheduling and an Introduction to IP Solution Techniques |
|
|
109 | (3) |
|
|
112 | (14) |
|
4 Real-World Operations Research Applications: An Introduction |
|
|
126 | (33) |
|
4.1 Vehicle Routing Problems |
|
|
126 | (4) |
|
4.2 Facility Location and Network Design Models |
|
|
130 | (9) |
|
4.3 Applications in the Airline Industry |
|
|
139 | (13) |
|
|
152 | (7) |
|
5 Introduction To Algorithm Design |
|
|
159 | (38) |
|
5.1 Exact and Heuristic Algorithms |
|
|
159 | (2) |
|
5.2 What to Ask When Designing Algorithms? |
|
|
161 | (1) |
|
5.3 Constructive versus Local Search Algorithms |
|
|
162 | (6) |
|
5.4 How Good is our Heuristic Solution? |
|
|
168 | (1) |
|
5.5 Examples of Constructive Methods |
|
|
169 | (12) |
|
5.6 Example of a Local Search Method |
|
|
181 | (1) |
|
5.7 Other Heuristic Methods |
|
|
182 | (1) |
|
5.8 Designing Exact Methods: Optimality Conditions |
|
|
183 | (6) |
|
|
189 | (8) |
|
6 Improving Search Algorithms And Convexity |
|
|
197 | (41) |
|
6.1 Improving Search and Optimal Solutions |
|
|
198 | (3) |
|
6.2 Finding Better Solutions |
|
|
201 | (13) |
|
6.3 Convexity: When Does Improving Search Imply Global Optimality? |
|
|
214 | (13) |
|
6.4 Farkas' Lemma: When Can No Improving Feasible Direction be Found? |
|
|
227 | (5) |
|
|
232 | (6) |
|
7 Geometry And Algebra Of Linear Programs |
|
|
238 | (33) |
|
7.1 Geometry and Algebra of "Corner Points" |
|
|
239 | (9) |
|
7.2 Fundamental Theorem of Linear Programming |
|
|
248 | (2) |
|
7.3 Linear Programs in Canonical Form |
|
|
250 | (12) |
|
|
262 | (9) |
|
8 Solving Linear Programs: Simplex Method |
|
|
271 | (46) |
|
|
271 | (14) |
|
8.2 Making the Simplex Method More Efficient |
|
|
285 | (4) |
|
8.3 Convergence, Degeneracy, and the Simplex Method |
|
|
289 | (5) |
|
8.4 Finding an Initial Solution: Two-Phase Method |
|
|
294 | (6) |
|
8.5 Bounded Simplex Method |
|
|
300 | (5) |
|
|
305 | (3) |
|
|
308 | (9) |
|
9 Linear Programming Duality |
|
|
317 | (34) |
|
9.1 Motivation: Generating Bounds |
|
|
317 | (4) |
|
|
321 | (6) |
|
|
327 | (6) |
|
9.4 Another Interpretation of the Simplex Method |
|
|
333 | (1) |
|
9.5 Farkas' Lemma Revisited |
|
|
334 | (2) |
|
9.6 Economic Interpretation of the Dual |
|
|
336 | (2) |
|
9.7 Another Duality Approach: Lagrangian Duality |
|
|
338 | (6) |
|
|
344 | (7) |
|
10 Sensitivity Analysis Of Linear Programs |
|
|
351 | (38) |
|
10.1 Graphical Sensitivity Analysis |
|
|
351 | (8) |
|
10.2 Sensitivity Analysis Calculations |
|
|
359 | (9) |
|
10.3 Use of Sensitivity Analysis |
|
|
368 | (7) |
|
10.4 Parametric Programming |
|
|
375 | (5) |
|
|
380 | (9) |
|
11 Algorithmic Applications Of Duality |
|
|
389 | (60) |
|
|
389 | (12) |
|
11.2 Transportation Problem |
|
|
401 | (13) |
|
|
414 | (6) |
|
11.4 Dantzig-Wolfe Decomposition |
|
|
420 | (12) |
|
11.5 Primal-Dual Interior Point Method |
|
|
432 | (9) |
|
|
441 | (8) |
|
12 Network Optimization Algorithms |
|
|
449 | (40) |
|
12.1 Introduction to Network Optimization |
|
|
449 | (1) |
|
12.2 Shortest Path Problems |
|
|
449 | (9) |
|
12.3 Maximum Flow Problems |
|
|
458 | (12) |
|
12.4 Minimum Cost Network Flow Problems |
|
|
470 | (14) |
|
|
484 | (5) |
|
13 Introduction To Integer Programming |
|
|
489 | (25) |
|
13.1 Basic Definitions and Formulations |
|
|
490 | (6) |
|
13.2 Relaxations and Bounds |
|
|
496 | (4) |
|
13.3 Preprocessing and Probing |
|
|
500 | (6) |
|
13.4 When are Integer Programs "Easy?" |
|
|
506 | (5) |
|
|
511 | (3) |
|
14 Solving Integer Programs: Exact Methods |
|
|
514 | (42) |
|
14.1 Complete Enumeration |
|
|
514 | (2) |
|
14.2 Branch-and-Bound Methods |
|
|
516 | (8) |
|
14.3 Valid Inequalities and Cutting Planes |
|
|
524 | (7) |
|
14.4 Gomory's Cutting Plane Algorithm |
|
|
531 | (5) |
|
14.5 Valid Inequalities for 0-1 Knapsack Constraints |
|
|
536 | (4) |
|
14.6 Branch-and-Cut Algorithms |
|
|
540 | (7) |
|
14.7 Computational Issues |
|
|
547 | (4) |
|
|
551 | (5) |
|
15 Solving Integer Programs: Modern Heuristic Techniques |
|
|
556 | (23) |
|
15.1 Review of Local Search Methods: Pros and Cons |
|
|
556 | (2) |
|
|
558 | (4) |
|
|
562 | (3) |
|
|
565 | (5) |
|
|
570 | (4) |
|
|
574 | (5) |
|
APPENDIX A BACKGROUND REVIEW |
|
|
579 | (18) |
|
|
579 | (2) |
|
|
581 | (2) |
|
|
583 | (14) |
Reference |
|
597 | (6) |
Index |
|
603 | |