Operative Research

Index

• 1. Foundations of Operations Research
  • 1.1 Introduction to Operations Research
  • 1.2 Mathematical Prerequisites
  • 1.3 Optimization Problem Formulation
• 2. Linear Programming
  • 2.1 LP Modeling
  • 2.2 Geometry of Linear Programming
  • 2.3 The Simplex Method
  • 2.4 Duality Theory
  • 2.5 Sensitivity and Post-Optimality Analysis
  • 2.6 Advanced LP Algorithms
• 3. Network Optimization
  • 3.1 Graph Theory Fundamentals
  • 3.2 Shortest Path Problems
  • 3.3 Minimum Spanning Trees
  • 3.4 Maximum Flow Problems
  • 3.5 Minimum Cost Flow Problems
  • 3.6 Transportation and Assignment Problems
• 4. Integer and Combinatorial Optimization
  • 4.1 Integer Programming Modeling
  • 4.2 Exact Solution Methods
  • 4.3 Classical Combinatorial Problems
  • 4.4 Computational Complexity in OR
• 5. Nonlinear Optimization
  • 5.1 Unconstrained Optimization
  • 5.2 Constrained Optimization
  • 5.3 Convex Optimization
• 6. Dynamic Programming
  • 6.1 Deterministic Dynamic Programming
  • 6.2 Stochastic Dynamic Programming
• 7. Multi-Objective Optimization and Decision Analysis
  • 7.1 Multi-Objective Optimization
  • 7.2 Decision Theory
  • 7.3 Multi-Criteria Decision Making
• 8. Game Theory
  • 8.1 Two-Person Zero-Sum Games
  • 8.2 Non-Zero-Sum and Cooperative Games
• 9. Stochastic Models
  • 9.1 Probability Review for OR
  • 9.2 Markov Chains
  • 9.3 Queueing Theory
  • 9.4 Stochastic Programming
• 10. Applied OR Models
  • 10.1 Inventory Theory
  • 10.2 Project Scheduling
  • 10.3 Machine and Job Scheduling
  • 10.4 Forecasting for Operations
• 11. Heuristics and Metaheuristics
  • 11.1 Constructive and Local Search Heuristics
  • 11.2 Metaheuristics
  • 11.3 Hybrid and Learning-Based Methods
• 12. Simulation
  • 12.1 Simulation Fundamentals
  • 12.2 Simulation Analysis
• 13. Computational Tools and Practice
  • 13.1 Modeling Languages and Solvers
  • 13.2 OR in Practice

<a id="1-foundations-of-operations-research"></a>