Skip to content
Tutorials Center
My learning

Topics

Operations Research Tutorial

Learn Operations Research step by step: 49 lessons in 9 chapters with examples, quizzes, diagrams and practice.

Start learning →

of lessons completed

Getting Started

  1. 1 Course Map: How to Study Operations Research Start here: what operations research is, who this course is for, what you need to know, how the nine chapters fit together and how to study them.
  2. 2 What Is Operations Research? Learn what operations research is, where it came from, which decisions it improves and why a computer can beat intuition when choices multiply.
  3. 3 The OR Modelling Process: From Problem to Decision Follow the six stages of an operations research study, from defining the problem and collecting data to validating the model and putting results to work.
  4. 4 A Python Toolkit for Operations Research Meet the Python tools used throughout this course: scipy's linprog and milp, graph routines, numpy and matplotlib, with runnable bakery examples.
  5. 5 Chapter 1 Review: Getting Started Review the foundations of operations research: definitions, history, the six-stage process and the Python toolkit, with a recap table and a ten-question quiz.

Modelling Decisions

  1. 6 Chapter 2 Overview: Modelling Decisions Chapter 2 overview: learn to turn a decision story into variables, an objective and constraints, the central skill of operations research.
  2. 7 Decision Variables, Objectives and Constraints Learn the three building blocks of every optimization model, how to choose variables and units, write objectives and constraints, and check linear assumptions.
  3. 8 The Product-Mix Model: Allocating Scarce Resources Build and solve a classic product-mix model for a furniture workshop, read slack and shadow prices, and learn what an extra hour of a scarce resource is worth.
  4. 9 Diet and Blending Models: Minimizing Cost Model cost-minimization problems with minimum requirements: the classic diet problem and an animal-feed blending model, solved with linprog and milp.
  5. 10 Binary Variables and Logic in Models Use yes/no variables to model selection, fixed setup costs, either-or rules and if-then conditions, with big-M constraints and milp examples.
  6. 11 Chapter 2 Review: Modelling Decisions Review Chapter 2: variables, objectives, constraints, product-mix, diet and blending, binary logic. Includes a words-to-math cheat sheet and ten quiz questions.

Linear and Integer Programming

  1. 12 Chapter 3 Overview: Linear and Integer Programming Chapter 3 overview: why linear programs have corner-point solutions, how the graphical method, simplex, duality and integer programming fit together.
  2. 13 The Graphical Method for Linear Programs Solve two-variable linear programs by drawing the feasible region, finding corner points and sliding the profit line, including infeasible and unbounded cases.
  3. 14 The Simplex Method Step by Step Learn how the simplex method walks from corner to corner using slack variables and a tableau, work the bakery example by hand and run a small simplex solver.
  4. 15 Duality and Sensitivity Analysis Understand the dual problem as a pricing problem, read shadow prices and reduced costs, and compute the ranges over which an optimal LP solution stays valid.
  5. 16 Integer Programming and Branch and Bound See why rounding an LP solution fails, how the LP relaxation gives bounds, and how branch and bound proves an integer optimum, with code that prints the tree.
  6. 17 Chapter 3 Review: Linear and Integer Programming Review Chapter 3: graphical method, simplex, duality and sensitivity, integer programming and branch and bound, with a one-page summary and ten quiz questions.

Network Optimization

  1. 18 Chapter 4 Overview: Network Optimization Chapter 4 overview: nodes, arcs and weights, the main families of network problems, how to store a network in code and why network models are special.
  2. 19 Shortest Paths and Dijkstra's Algorithm Learn how Dijkstra's algorithm finds shortest paths, trace it by hand on a delivery network, code it with a heap and check it against scipy and an LP model.
  3. 20 Minimum Spanning Trees: Kruskal and Prim Connect every node of a network at the lowest total cost: learn Kruskal's and Prim's algorithms, the cut property and union-find, with runnable Python.
  4. 21 Maximum Flow and Minimum Cut Find the largest amount that can flow through a capacitated network with augmenting paths, residual graphs and reverse edges, and prove it with a minimum cut.
  5. 22 Transportation and Assignment Problems Ship goods from factories to stores at least cost and match workers to jobs: model the transportation and assignment problems as network LPs and solve them in Python.
  6. 23 Chapter 4 Review: Network Optimization Review Chapter 4: shortest paths, minimum spanning trees, maximum flow, transportation and assignment, with a decision table, a code recap and ten quiz questions.

Inventory and Scheduling

  1. 24 Chapter 5 Overview: Inventory and Scheduling A map of chapter 5: how operations researchers decide how much to order, when to reorder and in what sequence to run jobs, with a roadmap of every lesson.
  2. 25 The EOQ Model: How Much to Order Derive and use the economic order quantity formula, find the best order size, reorder point and yearly cost, and see why the answer is forgiving.
  3. 26 Production Runs and Quantity Discounts Extend the EOQ model to a factory that makes its own stock (EPQ) and to suppliers that sell cheaper in bulk, with worked examples and code.
  4. 27 Uncertain Demand: Newsvendor and Safety Stock Decide how much to stock when demand is random: the critical ratio, service levels, safety stock and reorder points, with worked numbers and simulations.
  5. 28 Scheduling: Dispatch Rules and Johnson's Rule Sequence jobs on one machine with SPT and EDD, measure flow time and lateness, and minimize makespan on two machines with Johnson's rule, with code.
  6. 29 Chapter 5 Review: Inventory and Scheduling Review chapter 5 with a one-page picture, a table of formulas and rules, a quick calculator and a ten-question quiz on EOQ, EPQ, newsvendor and scheduling.

Queueing and Simulation

  1. 30 Chapter 6 Overview: Queueing and Simulation A map of chapter 6: why lines form, the vocabulary of queueing systems, and how formulas and simulation work together to predict waiting times.
  2. 31 The M/M/1 Queue: One Server, Exact Answers Learn the M/M/1 queue: derive the steady-state distribution, compute L, Lq, W and Wq, apply Little's law and choose a service rate that balances costs.
  3. 32 Several Servers: The Erlang C Model Staff a call center or checkout bank with the M/M/c queue: compute the Erlang C probability of waiting, average wait, service levels and the gain from pooling.
  4. 33 Discrete-Event Simulation Build a discrete-event simulation of a queue in Python: the event list, the clock, replications, warm-up, confidence intervals and checks against theory.
  5. 34 Chapter 6 Review: Queueing and Simulation Review chapter 6 with a one-page picture, a formula table, a checker for Little's law and a ten-question quiz on M/M/1, Erlang C and simulation.

Decision Analysis and Game Theory

  1. 35 Chapter 7 Overview: Decision Analysis and Game Theory A map of chapter 7: choosing under uncertainty with payoff tables and decision trees, valuing information, and finding optimal strategies against a rival.
  2. 36 Decision Trees, Criteria and the Value of Information Choose among alternatives under uncertainty with maximin, regret and expected value, roll back a decision tree, and compute the value of perfect and imperfect information.
  3. 37 Zero-Sum Games: Saddle Points and Mixed Strategies Solve two-player zero-sum games: find saddle points, remove dominated strategies, compute 2x2 mixed strategies and solve any matrix game with linear programming.
  4. 38 Chapter 7 Review: Decision Analysis and Game Theory Review chapter 7 with a one-page picture, a recap table, a reusable decision-tree roll-back function and a ten-question quiz on EMV, EVPI and zero-sum games.

Heuristics and Practice

  1. 39 Chapter 8 Overview: Heuristics and Practice A map of chapter 8: why some optimization problems defeat exact methods, how heuristics find good answers fast, and how operations research projects work in practice.
  2. 40 Construction Heuristics and Local Search Build good solutions fast with greedy rules, nearest neighbor and knapsack by ratio, then improve them with 2-opt local search, and measure the gap to the optimum.
  3. 41 Simulated Annealing and Other Metaheuristics Escape local optima with simulated annealing: the acceptance rule, cooling schedules and a full TSP run, plus tabu search and genetic algorithms compared.
  4. 42 From Messy Problem to Decision: The OR Workflow Follow a complete operations research project: understand the problem, build a model, solve it, run sensitivity analysis, validate and explain results.
  5. 43 Chapter 8 Review: Heuristics and Practice Review chapter 8 with a one-page picture, a table of heuristic families, a gap calculator and a ten-question quiz on greedy rules, 2-opt, annealing and the OR workflow.

Projects and Practice

  1. 44 Project: Test an Inventory Policy by Simulation Build a daily inventory simulator with random demand and delivery delay, compare it with EOQ and safety-stock formulas, and search for the cheapest reorder policy.
  2. 45 Project: Staff a Help Desk Staff a help desk across a day: compute hourly agent needs with Erlang C, cover them with shifts using integer programming, and verify the plan by simulation.
  3. 46 Practice Problems for Chapters 5 to 8 Fourteen worked practice problems on EOQ, EPQ, newsvendor, scheduling, queues, decisions, games and heuristics, with a self-check program and an answer table.
  4. 47 Glossary: Inventory, Queues, Decisions and Heuristics A plain-language glossary of the key terms from chapters 5 to 8: inventory, scheduling, queueing, simulation, decision analysis, games and heuristics, with flashcards.
  5. 48 Cheat Sheet: Operations Research on One Page A one-page cheat sheet for operations research chapters 5 to 8: inventory, scheduling, queueing, simulation, decisions, games and heuristics, with a reusable formula toolbox.
  6. 49 Further Study: Where to Go After Operations Research Plan your next steps in operations research: which topics deepen each chapter, a history timeline, tools and solvers, and the tracks on this site that continue the journey.