Skip to content

Operations Research

20 primes originate from Operations Research. 13 more draw from it as a secondary origin.

Primary members (20)

Primes whose canonical origin is Operations Research.

  • Branch and Bound — Systematic search with pruning.
  • Dynamic Programming — Solve via subproblem reuse.
  • Incident Response — A system facing acute, time-critical disruption engages a temporary command regime that prioritises stabilisation over diagnosis, accepts reversible degradation, defers root-cause analysis, and compresses decision authority for the duration of the acute phase only.
  • Integer Linear Programming (ILP) — Discrete optimization with integer variables.
  • Inventory Control Models (e.g., EOQ)
  • Linear Programming (LP) — Optimize linear objective with constraints.
  • Markov Decision Processes (MDPs) — Sequential decision-making under uncertainty.
  • Multiobjective Optimization — Balance competing objectives.
  • Network Flow Models — Optimize flow across networks.
  • Parallel Independent Inspection — Defect coverage of a fixed artifact rises with the number and diversity of independent inspectors working in overlapping parallel.
  • Prioritization — Ordering competing claims on finite resources by a value or urgency metric to produce a ranked sequence of action under constraint, making explicit what gets done first and what does not get done at all.
  • Pull Flow — An activity is triggered by a downstream demand signal rather than scheduled by an upstream producer, shifting uncertainty absorption from inventory to latency.
  • Queueing — Organizes tasks into a waiting line based on arrival and service rates.
  • Resource Management — Allocation of finite assets.
  • Scheduling — Organizing tasks over time.
  • Sensitivity Analysis (in Operations Research) — Analyze impact of parameter variation.
  • Sequencing — Deliberately ordering steps under precedence constraints so that the arrangement itself, not just the set of tasks, determines the outcome.
  • Simulated Annealing — Probabilistic search escaping local optima.
  • Traceability — The infrastructure of bidirectional links that lets any element be followed backward to its origin and forward to its uses, turning opaque processes into auditable, queryable histories.
  • Unevenness Waste — Variance in arrivals or service through finite shared capacity imposes its own cost — additive to the cost of the mean and rising nonlinearly near the capacity ceiling — so capacity sized to mean demand is not capacity adequate to demand.

Also draws from Operations Research (13)

Primes whose canonical origin is elsewhere, but who list Operations Research among their alternate origin domains.

  • Arbitrage (Generalized) — Exploiting a discrepancy in price, value, or perception across a boundary that friction keeps from equilibrating, extracting the spread until it closes.
  • Constraint — Limits possibilities to guide outcomes.
  • Deadlock — Mutual blocking processes.
  • Decision — Committing to one alternative from a set under uncertainty and trade-off, collapsing open deliberation into a chosen path and foreclosing the others.
  • Mechanism Design — Rule engineering.
  • Monte Carlo Simulation — Random sampling approximation.
  • Optimization — Finds best solution under constraints.
  • Pareto Efficiency — Optimal allocation.
  • Risk Pooling — Aggregating many independent or weakly correlated exposures so that the variance of the pooled outcome shrinks below the sum of individual variances, letting participants share a more predictable collective risk.
  • Satisficing — Accept good-enough solution.
  • Trade-offs — Balancing competing priorities.
  • Translation and Conceptual Bridging — Convert concepts or meanings between incommensurable frameworks.
  • Two-Sided Matching — Forming stable pairings between two sides of a market under each side's preferences.