The goal of the Encyclopedia of Operations Research and Management Science is to provide decision makers and problem solvers in business, industry, government, and academia a comprehensive overview of the wide range of ideas, methodologies, and synergistic forces that combine to form the preeminent decision-aiding fields of operations research and management science (OR/MS).

Table of Contents

• Preface
• About the Editors
• List of Contributors
• A
• A* Algorithm
• Acceptance-Rejection Method
• Active Constraint
• Activity
• Activity Level
• Activity-Analysis Problem
• Acyclic Network
• Adjacent
• Adjacent (Neighboring) Extreme Points
• Advertising
• Affiliated Values Bidding Model
• Affine Transformation
• Affine-Scaling Algorithm
• Agent
• Agent-Based Simulation
• Agriculture and the Food Industry
• Air Force Operations Research
• Air Traffic Management
• Airline Industry Operations Research
• Algebraic Modeling Languages for Optimization
• Algorithm
• Alternate Optima
• Alternate Paths
• AMPL
• Analytic Combat Model
• Analytic Hierarchy Process
• Analytic Network Process
• Analytics
• Ant Colony Optimization
• Anticycling Rules
• Applied Probability
• Approximate Dynamic Programming
• Arc
• Archimedean Axiom
• ARIMA
• Arrival Process
• Arrow Diagram
• Artificial Intelligence
• Artificial Variables
• Assignment Problem
• Auction and Bidding Models
• Automation in Manufacturing and Services
• Availability
• B
• Backward Chaining
• Backward Kolmogorov Equations
• Backward-Recurrence Time
• Balance Equations
• Balking
• Banking
• Bar Chart
• Barrier Functions and their Modifications
• Basic Feasible Solution
• Basic Solution
• Basic Variables
• Basis
• Basis Inverse
• Basis Vector
• Battle Modeling
• Bayes Rule
• Bayesian Decision Theory, Subjective Probability, and Utility
• Beale Tableau
• Bellman Optimality Equation
• Benders Decomposition Method
• Big M Method
• Bilevel Linear Programming
• Binary Variable
• Bin-Packing
• Bipartite Graph
• Birth-Death Process
• Bland's Anticycling Rules
• Blending Problem
• Block Pivoting
• Block-Angular System
• Block-Triangular Matrix
• Bonferroni Inequality
• Bootstrapping
• Bootstrapping: Resampling Methodology
• Bounded Rationality
• Bounded Variable
• Branch
• Branch and Bound
• Brownian Motion
• BTRAN
• Buffer
• Bulk Queues
• Burke's Theorem
• Business Intelligence
• Busy Period
• C
• Calculus of Variations
• Call and Contact Centers
• Call Priorities
• Candidate Rules
• Capacitated Transportation Problem
• Capital Budgeting
• CASE
• CDF
• Center for Naval Analyses
• Certainty Equivalence
• Certainty Factor
• Chain
• Chance Constraint
• Chance-Constrained Programming
• Chaos
• Chapman-Kolmogorov Equations
• Characteristic Function
• Chinese Postman Problem
• Choice Strategies
• Choice Theory
• Chromatic Number
• Chromosome
• CIM
• Closed Network
• Closed-Loop Supply Chains
• Cluster Analysis
• COEA
• Coefficient of Variation
• Cognitive Mapping
• Column Generation
• Column Vector
• Combat Model
• Combat Simulation
• Combinatorial Auctions
• Combinatorial Explosion
• Combinatorics
• Common Value Bidding Model
• Communications Networks
• Community OR
• Complementarity Applications
• Complementarity Condition
• Complementarity Problems
• Complementary Slackness Theorem
• Complex Problem Analyzing Method (Compram)
• Computational Biology
• Computational Complexity
• Computational Geometry
• Computational Organization Theory
• Computational Probability
• Computer Science and Operations Research Interfaces
• Concave Function
• Conclusion
• Conditional Value-at-Risk (CVaR)
• Cone
• Congestion System
• Conjoint Analysis
• Connected Graph
• Conservation of Flow
• Constrained Optimization Problem
• Constraint
• Constraint Programming
• Constraint Qualification
• Construction Applications
• Continuous-Time Markov Chain (CTMC)
• Control Theory
• Control Variates
• Controllable Variables
• Convex Combination
• Convex Cone
• Convex Function
• Convex Hull
• Convex Optimization
• Convex Polyhedron
• Convex Set
• Convexity Rows
• Convex-Programming Problem
• CONWIP
• Copula
• Corporate Strategy
• Cost Analysis
• Cost Coefficient
• Cost Row
• Cost Slope
• Cost Vector
• Cost-Effectiveness Analysis
• Coxian Distribution
• CPM
• Cramer's Rule
• Crash Cost
• Crash Time
• Crew Scheduling
• Crime and Justice
• Critical Activity
• Critical Path
• Critical Path Method (CPM)
• Critical Systems Thinking
• Cross-Entropy Method
• Crossover
• CS
• Curse of Dimensionality
• Customer Distribution
• Cut
• Cutset
• Cutting Stock Problems
• Cybernetics and Complex Adaptive Systems
• Cycle
• Cyclic Queueing Network
• Cyclic Service Discipline
• Cycling
• D
• Dantzig-Wolfe Decomposition Algorithm
• Data Envelopment Analysis
• Data Mining
• Data Warehousing
• Decision Analysis
• Decision Analysis in Practice
• Decision Maker (DM)
• Decision Making and Decision Analysis
• Decision Problem
• Decision Support Systems (DSS)
• Decision Trees
• Decision Variables
• Decomposition Algorithms
• Deep Uncertainty
• Degeneracy
• Degeneracy Graphs
• Degenerate Solution
• Degree
• Delay
• Delphi Method
• Density
• Density Function
• Departure Process
• Descriptive Model
• Design and Control
• Detailed Balance Equations
• Deterministic Model
• Developing Countries
• Development Tool
• Devex Pricing
• Deviation Variables
• DFR
• Diameter
• Diet Problem
• Differential Games
• Diffusion Approximation
• Diffusion Process
• Digital Music
• Digraph
• Dijkstra's Algorithm
• Direction of a Set
• Directional Derivative
• Disaster Management: Planning and Logistics
• Discrete-Time Markov Chain (DTMC)
• Disease Prevention, Detection, and Treatment
• Distribution Selection for Stochastic Modeling
• DMU
• Documentation
• Domain Knowledge
• Dual Linear-Programming Problem
• Duality Theorem
• Dualplex Method
• Dual-Simplex Method
• Dummy Arrow
• Dynamic Programming
• E>
• Earliest Finish Time
• Earliest Start Time
• Early British OR
• Econometrics
• Economic Order Quantity
• Economic Order Quantity Model Extensions
• Economics and Operations Research
• Edge
• Efficiency
• Efficient Solution
• Electric Power Systems
• Electronic Commerce
• Elementary Elimination Matrix
• Ellipsoid Algorithm
• ELSP
• Embedded Markov Chain
• Embedding
• Emergency Services
• EMS
• Engineering Applications
• Entering Variable
• Environmental Systems Analysis
• EOQ
• Ergodic Theorems
• Erlang
• Erlang B Formula
• Erlang C Formula
• Erlang Delay Model
• Erlang Distribution
• Erlang Loss Model
• Eta File
• Eta Vector
• Ethics in the Practice of Operations Research
• Euler Tour
• EURO
• Event-Driven Simulation
• Evolutionary Algorithms
• EVOP
• Ex Ante Forecasts
• Exclusive-or Node
• Expert Systems
• Exploratory Modeling and Analysis
• Exponential Arrivals
• Exponential Smoothing
• Exponential Tilting/Twisting
• Exponential-Bounded (–Time) Algorithm
• Extremal
• Extremal Column
• Extremal Problem
• Extreme Direction
• Extreme Point
• Extreme Point Solution
• Extreme Ray
• F
• Facilities Layout
• Facility Location
• Factorable Programming
• Failure-Rate Function
• Farkas’ Lemma
• Fast Fourier Transform
• Fathom
• FCFS
• Feasible Basis
• Feasible Region
• Feasible Solution
• FEBA
• Feedback Queue
• Field Analysis
• FIFO
• Financial Engineering
• Financial Markets
• Finite Source
• Fire Safety Modeling and Applications
• Firing a Rule
• First Feasible Solution
• First-order Conditions
• Fixed-Charge Problem
• Fleet Assignment
• Flexible Manufacturing Systems
• Float
• Flow
• Forecasting
• Forward Chaining
• Forward Kolmogorov Equations
• Forward-Recurrence Time
• Fourier Transform
• Fourier-Motzkin Elimination Method
• Fractional Programming
• Framing
• Free Float
• Free Variable
• Freight Routing
• Ftran
• Fuzzy Sets, Systems, and Applications
• G
• Game Theory
• Gaming
• Gamma Distribution
• GAMS
• Gantt Charts
• Gaussian Elimination
• Gauss-Jordan Elimination Method
• Gene
• Generalized Erlangian Distribution
• Generalized Upper-Bounded (GUB) Problem
• Generator (of a Markov Chain/Process)
• Genetic Algorithms
• Geographic Information Systems
• Geometric Programming
• GERT
• Gittins Index
• Global Balance Equations
• Global Climate Change Models
• Global Maximum (Minimum)
• Global Models
• Global Optimization
• Global Solution
• Goal Constraints
• Goal Programming
• Gomory Cut
• Gordan's Theorem
• Gradient Vector
• Graph
• Graph Theory
• Greedy Algorithm
• GRG Method
• Group Decision Computer Technology
• Group Decision Making
• GUI
• H
• Hamiltonian Tour
• Hamilton-Jacobi-Bellman Equation
• Health Care Management
• Health Care Strategic Decision Making
• Heavy-Tailed Distribution
• Heavy-Traffic Approximation
• Hedging
• Hessenberg Matrix
• Hessian Matrix
• Heterogeneous Lanchester Equations
• Heuristic Procedure
• Heuristics
• Hidden Markov Models
• Hierarchical Production Planning
• Higher Education
• Hirsch Conjecture
• Hit-and-Run Methods
• Homogeneous Lanchester Equations
• Homogeneous Linear Equations
• Homogeneous Solution
• Horn Clause
• Hospitals
• Hundred Percent Rule
• Hungarian Method
• Hybrid System
• Hypercube Queueing Model
• Hyperexponential Distribution
• Hypergame Analysis
• Hyperplane
• I
• Identity Matrix
• IFR
• IID
• Imbedded Markov Chain
• Implementation
• Implementation of OR/MS in the Public Sector
• Implicit Enumeration
• Importance Sampling
• Impossibility Theorem
• Inactive Constraint
• Incident
• Independent Float
• Independent Private Values Bidding Model
• Indirect Costs
• Industrial Applications
• Infeasible Solution
• Inference Engine
• Influence Diagrams
• Information Systems and Database Design in OR/MS
• Information Technology Benefits
• Input Process
• Input–Output Analysis
• Input–Output Coefficients
• Insensitivity
• Institute for Operations Research and the Management Sciences (INFORMS)
• Integer and Combinatorial Optimization
• Integer Goal Programming
• Integer-Programming Problem
• Intelligent Manufacturing Systems
• Intelligent Transportation Systems
• Intensity Function
• Interactive Multiple Objective Mathematical Programming
• Interchange Heuristic
• Interfering Float
• Interior Point
• Interior-Point Methods for Conic-Linear Optimization
• International Federation of Operational Research Societies (IFORS)
• International Institute for Applied Systems Analysis (IIASA)
• Invariant Distribution
• Inventory Modeling
• Inverse Matrix
• Inverse Transform Method
• IP
• IPA
• IS
• Isomorphic Graph
• Isoquant
• Iteration
• IVHS
• J
• Jackson Network
• Job Shop Scheduling
• Judgmental Bootstrapping
• Just-in-Time (JIT) Manufacturing
• K
• Kanban
• Karmarkar's Algorithm
• Karush-Kuhn-Tucker (KKT) Conditions
• Kendall's Notation
• Kilter Conditions
• KKT Conditions
• Klee-Minty Problem
• Knapsack Problem
• Knapsack Problems with Nonlinearities
• Knowledge Acquisition
• Knowledge Base
• Knowledge Engineer
• Knowledge Management
• Kruskal's Algorithm
• Kullback-Leibler Divergence
• L
• Lack of Memory
• Lagrange Multipliers
• Lagrangian Decomposition
• Lagrangian Function
• Lagrangian Relaxation
• Lanchester Attrition
• Lanchester's Equations
• Laplace Transform
• Laplace-Stieltjes Transform
• Large Deviations
• Large-Scale Systems
• Las Vegas Algorithm
• Latest Finish Time
• Latest Start Time
• LCFS
• LCP
• LDU Matrix Decomposition
• Learning
• Learning Curves
• Least-Squares Analysis
• Level Crossing Methods
• Level Curve
• Lexicographic Ordering
• Lexico-Positive (Negative) Vector
• LGP
• Libraries
• LIFO
• Light-Tailed Distribution
• Likelihood Ratio Method
• Limiting Distribution
• Lindley's Equation
• Line
• Line Segment
• Linear Combination
• Linear Equation
• Linear Functional
• Linear Inequality
• Linear Programming
• Linear-Fractional Programming Problem
• Lipschitz Continuous
• Little's Law
• Little's Law in Distributional Form
• Local Balance Equations
• Local Improvement Heuristic
• Local Maximum
• Local Minimum
• Local Optimum
• Local Solution
• Location Analysis
• Logic Programming
• Logical Variables
• Logistics and Supply Chain Management
• Log-Linear Model
• Longest-Route Problem
• Loss Function
• Lottery
• Lower-Bounded Variables
• LU matrix decomposition
• M
• Machine Learning
• MAD
• Maintenance
• Manpower Planning
• Manufacturing
• MAP
• Marginal Value
• Marketing
• Markov Chain Equations
• Markov Chain Monte Carlo
• Markov Chains
• Markov Decision Processes
• Markov Processes
• Markov Property
• Markov Random Field
• Markov Renewal Process
• Markov Routing
• Marriage Problem
• Martingale
• Master Problem
• Matching
• Material Handling
• Material Requirements Planning
• Mathematical Model
• Mathematical Optimization Society
• Mathematical Programming
• Mathematical-Programming Problem
• Mathematical-Programming System (MPS)
• Matrices and Matrix Algebra
• Matrix Geometric
• Matrix-Analytic Stochastic Models
• Max-Flow Min-Cut Theorem
• Maximum
• Maximum Matching Problem
• Maximum-Flow Network Problem
• Measure of Effectiveness (MOE)
• Memetic Algorithms
• Memoryless Property
• Menu Planning
• Metagame Analysis
• Metaheuristics
• Metamodeling
• Method of Stages
• Military Operations Other Than War
• Military Operations Research
• MIMD
• Minimum
• Minimum (Maximum) Feasible Solution
• Minimum Spanning Tree Problem
• Minimum-Cost Network-Flow Problem
• MIS
• Mixed Network
• Mixed-Integer Programming Problem (MIP)
• Model
• Model Accreditation
• Model Builder's Risk
• Model Evaluation
• Model Management
• Model Testing
• Model User's Risk
• Model Verification
• Model-based Search Methods
• MODI
• MOIP
• MOLP
• Moment Generating Function
• Monte Carlo Methods
• Monte Carlo Simulation
• MOR
• Moral Hazard
• MORS
• MS
• MSE
• Multicommodity Network Flows
• Multicommodity Network-Flow Problem
• Multidimensional Transportation Problem
• Multiobjective Linear-Programming Problem
• Multiobjective Programming
• Multi-armed Bandit Problem
• Multi-attribute Utility Theory
• Multi-Echelon Inventory Systems
• Multi-Echelon Logistics Systems
• Multiple Criteria Decision Making
• Multiple Optimal Solutions
• Multiple Pricing
• Multiplier Vector
• Multivariate Quality Control
• N
• Nash Equilibrium
• Nash Saddle-Point
• Natural Resources
• Near-Optimal Solution
• Neighboring Extreme Point
• Nested Partitions Method
• Network
• Network Design
• Network Optimization
• Network Planning
• Network Simplex Algorithm
• Networks of Queues
• Neural Networks
• Neuro Dynamic Programming
• Newsboy Problem
• Newsvendor Problem
• Newton's Method
• Node
• Node-Arc Incidence Matrix
• Nonactive (Nonbinding) Constraint
• Nonbasic Variable
• Nondegenerate Basic Feasible Solution
• Nonlinear Goal Programming
• Nonlinear Programming
• Nonnegative Solution
• Nonnegativity Conditions
• Nonsingular Matrix
• Nontrivial Solution
• Nonzero-Sum Game
• Non-Archimedean Number
• Non-Compensatory Choice Strategies
• Non-Preemptive
• Non-uniform Random Variates
• Normative Model
• Northwest-Corner Solution
• Null Matrix
• Null Space
• Numerical Analysis
• O
• O, o Notation
• Objective Function
• OEG
• Offered Load
• Open Network
• Open-Source Software and the Computational Infrastructure for Operations Research (COIN-OR)
• Operational Research Society (ORS)
• Operations Management
• Operations Research Office and Research Analysis Corporation
• Operations Research Society of America (ORSA)
• Opportunity Cost
• Optimal Computing Budget Allocation
• Optimal Control
• Optimal Feasible Solution
• Optimal Stopping
• Optimal Value
• Optimal Value Function
• Optimality Criteria
• Optimization
• Optimization of Queues
• Option Pricing
• OR
• OR/MS
• Ordinal Optimization
• Organization
• Origin Node
• Out-of-Kilter Algorithm
• Output Process
• Outside Observer Distribution
• Overachievement Variable
• Overflow Process
• Overtaking
• P
• P4
• Packing Problem
• Parallel Computing
• Parameter
• Parameter-Homogeneous Stochastic Process
• Parametric Bound
• Parametric Linear Programming
• Parametric Programming
• Parametric Solution
• Pareto-Optimal Solution
• Partial Balance Equations
• Partial Pricing
• Partially Observed Markov Decision Processes
• Particle Swarm Optimization
• PASTA
• Path
• Payoff Function
• Payoff Matrix
• PDA
• PDF
• PDSA
• Periodic Review
• PERT
• Perturbation
• Perturbation Analysis
• Perturbation Methods
• Petroleum Refining
• Phase I Procedure
• Phase II Procedure
• Phase-type Probability Distributions
• Piecewise Linear Function
• Pivot Column
• Pivot Element
• Pivot Row
• Pivot-Selection Rules
• PMF
• Point Stochastic Processes
• Point-to-Set Map
• Poisson Arrivals
• Poisson Process
• Politics
• Pollaczek-Khintchine Formula
• Polling System
• Polyhedron
• Polynomial Hierarchy
• Polynomially Bounded (−Time) Algorithm (Polynomial Algorithm)
• Population-based Search Methods
• Portfolio Theory: Mean-Variance Model
• POS
• Postoptimal Analysis
• PPB(S)
• Practice of Operations Research and Management Science
• Precedence Diagramming
• Predictive Model
• Preemption
• Preference Theory
• Prescriptive Model
• Prices
• Pricing Out
• Prim's Algorithm
• Primal Problem
• Primal-Dual Algorithm
• Principle of Optimality
• Prisoner's Dilemma
• Probabilistic Algorithm
• Probabilistic Programming
• Probability Density Function (PDF)
• Probability Distribution
• Probability Generating Function
• Probability Integral Transformation Method
• Probability Mass Function (PMF)
• Problem Solving
• Problem Structuring Methods
• Processor Sharing
• Product Form of the Inverse (PFI)
• Product-Form Solution
• Production Management
• Production Rule
• Program Evaluation
• Program Evaluation and Review Technique (PERT)
• Project Management
• Project SCOOP
• Projection Matrix
• Proper Coloring
• Prospect Theory
• Protocols
• Pseudoconcave Function
• Pseudoconvex Function
• Pseudorandom Numbers
• Pseudo-Polynomial-Time Algorithm
• Public Policy Analysis
• Pull System
• Pure-Integer Programming Problem
• Push System
• Q
• QC
• Q-Gert
• Quadratic Assignment Problem
• Quadratic Form
• Quadratic Programming
• Quadratic-Integer Programming
• Quadratic-Programming Problem
• Quality Control
• Quasi-concave Function
• Quasi-convex Function
• Quasi-reversibility
• Queue Inference Engine
• Queueing Discipline
• Queueing Theory
• R
• R Chart
• Radon-Nikodym Derivative
• Rail Freight Operations
• RAND Corporation
• Random Field
• Random Number Generators
• Random Search
• Random Variates
• Random Walk
• Randomized Algorithm
• Ranging
• Rank
• Ranking and Selection
• Rare Event Simulation
• Rate Matrix
• Ray
• Reasoning
• Reasoning Knowledge
• Recognition Problem
• Redundancy
• Redundant Constraint
• Regeneration Points
• Regenerative Process
• Regenerative Simulation
• Regression Analysis
• Reinforcement Learning
• Relaxed Problem
• Reliability
• Reliability Function
• Reliability of Stochastic Systems
• Reneging
• Renewal Process
• Representation Theorem for Polyhedral Set
• Research and Development
• Resource Aggregation
• Resource Leveling
• Resource Smoothing
• Response Surface Methodology
• Response Time
• Restricted-Basis Entry Rule
• Retailing
• Revenue Equivalence Theorem
• Revenue Management
• Reversible Markov Chain/Process
• Revised Simplex Method
• Right-Hand Side
• Risk
• Risk Assessment
• Risk Management for Software Engineering
• Ritter's Partitioning Method
• Robust Optimization
• Robustness Analysis
• Role-Playing
• Rosen's Partitioning Method
• Roundoff Error
• Route Construction Heuristic
• Route Improvement Heuristic
• Row Vector
• Rule
• Rule Set
• Rule-Based Forecasting
• S
• SA
• Saddle-Point of a Function
• Saddle-Point of a Game
• Saddle-Point Problem
• Safety
• Sample Average Approximation
• Sand Table Battle Model
• Satisficing
• Scaling
• Scenario
• SCERT
• Scheduling and Sequencing
• Score Functions
• Scripted Battle Model
• Search Theory
• Second-order Conditions
• Self-Dual Parametric Algorithm
• Semi-Markov Process
• Semi-Strictly Quasi-Concave Function
• Semi-Strictly Quasi-Convex Function
• Sensitivity Analysis
• Separable Function
• Separable-Programming Problem
• Separating Hyperplane Theorem
• Series Queues
• Service Science
• Service Systems
• Set-covering Problem
• Set-partitioning Problem
• SEU
• Shadow Prices
• Shapley Value
• Shell
• Shortest-route Problem
• SIMD
• Simple Upper-bounded Problem (SUB)
• Simplex
• Simplex Method (Algorithm)
• Simplex Tableau
• Simulated Annealing
• Simulation Metamodeling
• Simulation of Stochastic Discrete-Event Systems
• Simulation Optimization
• Simulator
• Single-server Network
• Singular Matrix
• Sink Node
• SIRO
• Skew-symmetric Matrix
• Slack Variable
• Slack Vector
• SLP
• Smooth Patterns of Production
• Societal Complexity
• Soft Systems Methodology
• Sojourn Time
• Solution
• Solution Space
• Source Node
• SPA
• Space
• Spanning Tree
• Sparse Matrix
• Special-Ordered Sets (SOS)
• Splines
• Sports
• Spreadsheets
• SQC
• Square Root Law
• st or s.t.
• St. Petersburg Paradox
• Stages
• Staircase Structure
• Stationary Distribution
• Stationary Stochastic Process
• Stationary Transition Probabilities
• Statistical Equilibrium
• Statistical Ranking and Selection
• Steady State
• Steady-state Distribution
• Steepest Descent Method
• Steiner Tree Problem
• Stepping-Stone Method
• Stigler's Diet Problem
• Stochastic Approximation
• Stochastic Duel
• Stochastic Dynamic Programming
• Stochastic Input Model Selection
• Stochastic Model
• Stochastic Optimization
• Stochastic Process
• Stochastic Programming
• Strategic Assumption Surfacing and Testing (SAST)
• Strategic Choice Approach (SCA)
• Strategic Options Development and Analysis (SODA)
• Strictly Quasi-Concave Function
• Strictly Quasi-Convex Function
• Strong Duality Theorem
• Strongly Polynomial-time Algorithm
• Structural Variables
• Structured Modeling
• Subderivative
• Subdifferential
• Subgradient
• Subjective Probability
• Suboptimization
• Super-Sparsity
• Supplemental Variables
• Supply Chain Management
• Surplus Variable
• Surplus Vector
• Swarm Intelligence
• Symmetric Matrix
• Symmetric Primal-Dual Problems
• Symmetric Queueing Network
• Symmetric Zero-Sum Two-Person Game
• System
• System Dynamics
• Systems Analysis
• T
• Tabu Search
• Tail Distribution Function
• Tandem Queues
• Technological Coefficients
• Telecommunication Networks
• Terminal
• The Institute of Management Sciences (TIMS)
• Theorem of Alternatives
• Theory of Constraints
• Thickness
• Time Series Analysis
• Time/Cost Trade-offs
• Time-stepped Simulation
• Timetabling
• Tolerance Analysis
• Total Float
• Total Quality Management
• TQC
• TQM
• Traffic Analysis
• Traffic Equations
• Traffic Intensity
• Traffic Process
• Transient Analysis
• Transition Function
• Transition Matrix
• Transition Probabilities
• Transportation Problem
• Transportation Problem Paradox
• Transportation Simplex (Primal-Dual) Method
• Transposition Theorems
• Traveling Salesman Problem
• Tree
• Triangular Matrix
• Trim Problem
• Trivial Solution
• Truck Dispatching
• Truckload (TL) Shipment
• Tucker Tableau
• Two-Phase Simplex Method
• U
• Unbalanced Transportation Problem
• Unbounded Optimal Solution
• Unconstrained Optimization
• Unconstrained Solution
• Uncontrollable Variables
• Underachievement Variable
• Underdetermined System of Linear Equations
• Undirected Arc
• Unimodular Matrix
• Unique Solution
• Unrestricted Variable
• Unsymmetric Primal-Dual Problems
• Urban Services
• Utility Theory
• V
• Vacation Model
• Vacation Time
• Validation
• Value at Risk
• Value Function
• Variance Reduction Techniques in Monte Carlo Methods
• Vector Space
• Vehicle Routing
• Verification
• Verification, Validation, and Testing of Models
• VERT
• Virtual Reality
• Visualization
• Vogel's Approximation Method (VAM)
• Voronoi Constructs
• VV&A
• W
• Waiting Time
• War Game
• Warehouse Problem
• Water Resources
• Weak Derivatives
• Weakly-Coupled Systems
• Wicked Problems
• Wilkinson Equivalent Random Technique
• WIMP
• Winner's Curse
• Wolfe's Quadratic-Programming Problem Algorithm
• Work Schedule
• Worst-Case Analysis
• X
• X Chart
• Y
• Yield Management
• Z
• Zero-One Goal Programming
• Zero-Sum
• Zero-Sum Game