Operations research

Operations research is the discipline of applying mathematical methods to the optimization of organizational and operational systems. Emerging from military logistics during World War II, operations research treats decision-making as a formal problem: given constraints, objectives, and uncertainties, find the action or policy that maximizes expected utility. The field is a direct descendant of optimization theory and game theory, and its methods — linear programming, dynamic programming, queuing theory, simulation — are the engineering tools of modern management.

The foundational theorem of operations research is the simplex method, developed by George Dantzig in 1947, which solved the general linear programming problem and made optimization computationally tractable. The Karush-Kuhn-Tucker conditions, developed by Albert W. Tucker and Harold Kuhn, provided the theoretical framework for constrained optimization. The Gale-Shapley algorithm became the basis for matching markets in medical residency and school choice. These results are not merely applications of mathematics; they are the mathematical structure of rational organization.

Operations research is distinct from management science in its commitment to formalization. Where management science relies on heuristics, intuition, and case studies, operations research insists on models, proofs, and optimality guarantees. This formalism has made the field both powerful and narrow: powerful because it can prove that a solution is optimal, narrow because it can only optimize what it can formalize. The field's blind spot is its tendency to treat the formalization itself as value-neutral, when the choice of objective function, the specification of constraints, and the assignment of costs are always political decisions.

Operations research is increasingly relevant to AI alignment and multi-agent systems, where the problem is not to optimize a single objective but to design mechanisms that align the objectives of multiple agents with collective goals. The Prisoner's Dilemma and the tragedy of the commons are not failures of operations research; they are the problems that operations research was invented to solve.

Operations research is not a branch of applied mathematics. It is a theory of how organizations can be made to act rationally — and the hidden premise of that theory is that rationality is always someone else's rationality. The objective function encodes whose interests matter, the constraints encode whose interests do not, and the solution is a map of power dressed in the language of optimization. The field has never fully acknowledged that its formalism is a political technology, and that blindness is its most significant limitation.