A* Algorithm -- Acceptance sampling -- Accounting prices -- Accreditation -- Active constraint -- Active set methods -- Activity -- Activity-analysis problem -- Activity level -- Acyclic network -- Adjacent -- Adjacent (neighboring) extreme points -- Advertising Kalyanaram/Bass -- Affiliated values bidding model -- Affine transformation -- Affine-scaling algorithm -- Agency theory -- Agriculture and the food industry Bender/Kahan -- AHP -- AI -- Air force operations analysis Thomas -- Airline industry Ryan -- Algebraic modeling languages for optimization Rosenthal -- Algorithm -- Algorithmic complexity -- Alternate optima -- Alternate paths -- Analytic combat model -- Analytic hierarchy process Saaty -- Animation -- Anticycling rules -- Antithetic random variates -- Applied probability -- Arc -- Archimedean axiom -- ARIMA -- Arrival process -- Arrival-point distribution -- Arrow diagram -- Artificial intelligence Greenberg -- Artificial variables -- Assignment problem -- Automation Liberatore -- Availability Ushakov -- Averch-Johnson hypothesis -- Backward chaining -- Backward Kolmogorov equations -- Backward-recurrence time -- Balance equations -- Balking -- Banking Zenios -- Bar chart -- Barrier and distance functions Polyak -- Basic feasible solution -- Basic solution -- Basic variables -- Basis -- Basis inverse -- Basis vector -- Batch shops -- Battle modeling Hartley -- Bayesian decision theory, subjective probability and utility Laskey -- Bayes rule -- Beale tableau -- Bender's decomposition method -- Best-fit decreasing algorithm -- Bidding models Rothkopf -- Big-M method -- Bilevel linear programming -- Binary variable -- Bin-packing Wang/Coleman -- Bipartite graph -- Birth-death process -- Bland's anticycling rules -- Blending problem -- Block-angular system -- Block pivoting -- Block-triangular matrix -- Bootstrapping -- Bounded rationality -- Bounded variable -- Branch -- Branch and bound -- Brownian motion -- BTRAN -- Buffer -- Bulk queues -- Burke's theorem -- Busy period -- Calculus of variations Nash -- Call priorities -- Candidate rules -- Capacitated transportation problem -- Capital budgeting Levary -- CASE -- CDF -- Center for Naval Analyses Harris -- Certainty equivalent -- Certainty factor -- Chain -- Chance-constrained programming -- Chance constraint -- Chaos -- Chapman-Kolmogorov equations -- Chinese postman problem Stewart -- Choice strategies -- Choice theory Adelman -- Chromatic number -- Chromosome -- Circling -- CIM -- Classical optimization -- Closed network -- Cluster analysis Aronson/Sundaram -- Cobb-Douglas production function -- COEA -- Coefficient of variation -- Cognitive mapping -- Coherent system -- Column generation -- Column vector -- Combat model -- Combat simulation -- Combinatorial and integer optimization Hoffman/Padberg -- Combinatorial explosion -- Combinatorics Lawler -- Common random variates -- Common value bidding model -- Communications networks Sykes -- Community operations research -- Complementarity condition -- Complementarity problems Cottle -- Complementary pivot algorithm -- Complementary slackness theorem -- Computational complexity Hall -- Computational geometry Beichl/Bernal/Witzgall/Sullivan -- Computational probability -- Computer science and operations research Sharda -- Concave function -- Conclusion -- Condition number -- Cone -- Congestion system -- Conjugate gradient method -- Connected graph -- Conservation of flow -- Constrained optimization problem -- Constraint -- Constraint qualification -- Construction applications Perry -- Continuous-time Markov chain (CTMC) -- Control charts -- Controllable variables -- Control theory Manitius -- Convex combination -- Convex cone -- Convex function -- Convex hull -- Convex polyhedron -- Convex-programming problem -- Convex set -- Convexity rows -- Corner point -- Corporate strategy Hax/Majluf -- Cost analysis Balut/Gulledge -- Cost coefficient -- Cost effectiveness analysis Womer -- Cost range -- Cost row -- Cost slope -- Cost vector -- COV -- Covering problem -- Coxian distribution -- CPM -- CPP -- Cramer's rule -- Crash cost -- Crash time -- Crew scheduling -- Crime and justice Barnett/Maltz -- Criterion cone -- Criterion space -- Criterion vector -- Critical activity -- Critical path -- Critical path method (CPM) -- Crossover -- Curse of dimensionality -- Customer distribution -- Cut -- Cut set -- Cutting stock problems Haessler -- CV -- Cybernetics Sage -- Cycle -- Cyclic queueing network -- Cyclic service discipline -- Cycling -- Danzig-Wolfe decomposition algorithm -- Database design -- Data envelopment analysis Cooper -- DEA -- Decision analysis Schum -- Decision maker (DM) -- Decision making Buede -- Decision problem -- Decision support systems Vazsonyi -- Decision trees Eriksen/Keller -- Decision variables -- Decomposition algorithm -- Degeneracy -- Degenerate solution -- Degree -- Delaunay triangulation -- Delay -- Delphi method Dewar/Friel -- Density -- Density function -- Departure process -- Descriptive model -- Design and control -- Detailed balance equations -- Determinant -- Deterministic model -- Developing countries Galvão -- Development tool -- Devex pricing -- Deviation variables -- DFR -- Diameter -- Diet problem -- Diffusion approximation -- Diffusion process -- Digraph -- Dijkstra's algorithm -- Directed graph -- Direction of a set -- Directional derivative -- Discrete-programming problem -- Discrete-time Markov chain (DTMC) -- Distribution selection for stochastic modeling Gross -- DMU -- Documentation Gass -- Domain knowledge -- DSS -- Dual linear-programming problem -- Dual-simplex method -- Duality theorem -- Dualplex method -- Dummy arrow -- Dynamic programming White -- Earliest finish time -- Earliest start time -- Econometrics Kelejian/Prucha -- Economic order quantity -- Economics Murphy -- Edge -- Efficiency -- Efficiency frontier -- Efficient algorithm -- Efficient point -- Efficient solution -- Eigenvalue -- Eigenvector -- Electric power systems Yu -- Elementary elimination matrix -- Elimination method -- Ellipsoid algorithm -- ELSP -- Embedding -- Emergency services Chelst -- EMS -- Entering variable -- Environmental systems analysis ReVelle -- EOQ -- Ergodic theorems -- Erlang -- Erlang B formula -- Erlang C formula -- Erlang delay model -- Erlang distribution -- Erlang loss model -- Error analysis -- Eta file -- Eta matrix -- Eta vector -- Ethics Engel -- Euler tour -- Evaluation -- Event-driven simulation -- EVOP -- Ex ante forecasts -- Exclusive-or node -- Expected utility theory -- Expert systems Holsapple/Whinston -- Exploratory modeling Bankes -- Exponential arrivals -- Exponential-bounded (-time) algorithm -- Exponential smoothing Brown -- Extremal -- Extremal column -- Extremal problem -- Extreme direction -- Extreme point -- Extreme point solution -- Extreme ray -- Face validity -- Facilities layout Kaku -- Facility location Chhajed, Francis, Lowe -- Factorable programming Jackson -- Failure-rate function -- Farkas' lemma -- Farrell measure -- Fathom -- FCFS -- Feasible basis -- Feasible region -- Feasible solution -- FEBA -- Feedback queue -- Field analysis Kreiner -- FIFO -- Finite source -- Fire models Levin -- Firing a rule -- First feasible solution -- First-fit decreasing algorithm -- First-order conditions -- Fixed-charge problem -- Flexible manufacturing systems Stecke -- Float -- Flow -- Flow shop -- Flow time -- FMS -- Forecasting Armstrong -- Forward chaining -- Forward Kolmogorov equations -- Forward-recurrence time -- Fourier-Motzkin elimination method -- Fractional programming Schaible -- Framing -- Frank-Wolfe method -- Free float -- Free variable -- Freight routing -- FTRAN -- Fuzzy sets Gass -- GA -- Game theory Lucas -- Gaming Schwabe -- Gamma distribution -- Gantt charts Nahmias -- Gaussian elimination -- Gauss-Jordan elimination method -- Gene -- Generalized Erlangian distribution -- Generalized upper-bounded (GUB) problem -- Generator (of a Markov process) -- Genetic algorithms Michalewicz -- Geographic information systems Gray/Suchocki -- Geometric programming Ecker -- GERT -- GIS -- Global balance equations -- Global maximum (minimum) -- Global models Gass -- Global solution -- Goal constraints -- Goal programming Schniederjans -- Gomory cut -- Gordan's theorem -- GP -- Gradient vector -- Graeco-Latin square -- Graph -- Graphical evaluation and review technique -- Graphics -- Graph theory Shier -- Greedy algorithm -- GRG method -- Group decision

computer technology Buede -- Group decision making Zahedi -- GUB -- Half space -- Hamiltonian tour -- Hazard rate -- Health care systems Gascon/Pierskalla -- Heavy-traffic approximation -- Hessenberg matrix -- Hessian matrix -- Heterogeneous Lanchester equations -- Heuristic procedure -- Hierarchical production planning Hax -- Higher education Hearn/Lough -- Hirsch conjecture -- Homogeneous Lanchester equations -- Homogeneous linear equations -- Homogeneous solution -- Horn clause -- Hospitals Morey -- Hundred percent rule -- Hungarian method -- Hypercube queueing model Larson -- Hyperexponential distribution -- Hypergame analysis -- Hyperplane -- Identity matrix -- IFORS -- IFR -- IIASA -- IID -- Imbedded Markov chain -- Implementation Woolsey -- Implicit enumeration -- Implicit price -- Importance sampling -- Impossibility theorem -- Inactive constraint -- Incidence matrix -- Incident -- Independent float -- Independent private values bidding model -- Indirect costs -- Industrial applications and OR Fortuin/van Beek/Van Wassenhove -- Industrial dynamics -- Industrial engineering and operations research Jarvis -- Infeasible solution -- Inference engine -- Influence diagrams -- Information systems and database design in OR/MSMüller-Merbach -- INFORMS -- Initial feasible solution -- Input process -- Input-output analysis -- Input-output coefficients -- Insensitivity -- Institute for Operations Research and the Management Sciences (INFORMS) -- Integer goal programming -.