Operations research - Further Reading and Resources

External Resources for Further Learning in Operations Research Understanding This Resource List This section provides a curated collection of classic books and modern textbooks in Operations Research. Rather than being study material itself, this reading list serves as a guide to where you can find in-depth explanations of core OR concepts. Many of these works are foundational texts that established entire subfields within operations research, and understanding the ideas they contain is important for exam preparation. The works listed here are organized by topic area to help you see which resources cover which concepts you're studying. Classic Foundational Works Linear Programming and Optimization Methods The study of linear programming is central to operations research. Two essential works establish the theoretical and practical foundations: Linear Programming and Extensions (1963) by George Dantzig is the definitive source on the simplex method, the algorithm that revolutionized practical optimization. This method remains the standard approach for solving linear programming problems and is likely essential knowledge for your exam. Management Models and Industrial Applications of Linear Programming (1961) by Abraham Charnes and William Cooper demonstrates how linear programming actually gets applied to real industrial problems—this bridges theory and practice. For problems involving assignment of resources, The Hungarian Method for the Assignment Problem (1955) by Harold Kuhn provides the efficient algorithm specifically designed for this class of problems. Advanced Optimization Theory Nonlinear Programming (1973) by Harold Kuhn and Albert Tucker introduces the Karush-Kuhn-Tucker (KKT) conditions, which characterize optimal solutions in nonlinear optimization problems. This theoretical framework extends beyond linear programming to more complex real-world problems. Dynamic Programming (1957) by Richard Bellman established the principle of optimality and recursive solution techniques for multistage decision problems. Dynamic programming is a fundamental technique for breaking complex problems into simpler subproblems. Network Problems Flows in Networks (1962) by Lester Ford, Jr. and D. Ray Fulkerson introduced the max-flow min-cut theorem and algorithmic approaches to network flow problems. This work is crucial for understanding optimization on networks, which appear frequently in transportation, logistics, and resource allocation problems. Problem-Specific Applications Production and Inventory Planning Planning Production, Inventories, and Work Force (1960) by Charles Holt, Franco Modigliani, John Muth, and Herbert Simon addresses practical models for production scheduling and inventory control—topics that connect optimization theory to real manufacturing decisions. Activity Analysis of Production and Allocation (1951) edited by Tjalling C. Koopmans introduced input-output analysis, providing frameworks for thinking about production planning across interconnected systems. Decision Analysis Under Uncertainty Decisions with Multiple Objectives (1976) by Ralph Keeney and Howard Raiffa explains multi-criteria decision analysis and how to evaluate trade-offs when multiple, competing objectives exist. Real problems rarely have single objectives, making this framework valuable. Applied Statistical Decision Theory (1961) by Robert Schlaifer and Howard Raiffa integrates statistical inference with decision theory, showing how to make optimal decisions when you have incomplete information. <extrainfo> Additional Specialized Topics Industrial Dynamics (1961) by Jay Forrester pioneered system dynamics modeling for understanding complex industrial and economic systems over time—an approach that complements the optimization-focused methods in other works. Search and Screening (1980) by B. O. Koopman presented general principles and historical applications of search theory, with applications ranging from military operations to resource discovery. </extrainfo> Modern Textbook Algorithms for Decision Making (2022) by Mykel J. Kochenderfer, Tim A. Wheeler, and Kyle H. Wray represents the modern evolution of operations research, introducing algorithmic approaches for artificial intelligence decision problems. This recent text shows how classical OR concepts have evolved for contemporary applications.