"Encyclopedia of Operations Research and Management Science" auf Englisch kaufen

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.- Boundedrationality.- 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-simplexmethod.- 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.- Integer-programming problem.- Intensity function.- Interactive optimization.- Interchange heuristic.- Interfering float.- Interior point.- Interior-point methods Boggs.- International Federation of Operational Research Societies (IFORS).- International Institute for Applied Systems Analysis (IIASA).- Intervention model.- Inventory modeling Silver.- Inverse matrix.- IP.- IS.- Isomorphic graph.- ISOP 9000 standard.- Isoquant.- Iteration.- IVHS.- Jackson network.- Job shop scheduling Jones/Rabelo/Yih.- Johnson’s theorem.- Just-in-time (JIT) manufacturing.- Karmarkar’s algorithm.- Karush-Kuhn-Tucker (KKT) conditions.- Kendall’s notation.- Kilter conditions.- KKT conditions.- Klee-Minty problem.- Knapsack problem.- Knowledge acquisition.- Knowledge base.- Knowledge engineer.- Königsberg bridge problem.- König’s theorem.- Kruskal’s algorithm.- Kuhn-Tucker (KT) conditions.- Lack of memory.- Lagrange multipliers.- Lagrangian decomposition.- Lagrangian function.- Lagrangian relaxation.- Lanchester attrition.- Lanchester’s equations Engel.- Laplace-Stieltjes transform.- Laplace transform.- Large-scale systems Ho.- Latest finish time.- Latest start time.- Latin square.- LCFS.- LCP.- LDUmatrix decomposition.- Learning Buck.- Learning curves Loerch.- Least-squares analysis.- Leontief matrix.- Level-crossing methods Brill.- Level curve.- Lexicographic ordering.- Lexico-positive (negative) vector.- LGP.- Libraries Reisman/Xu.- LIFO.- Likelihood ratio.- Limiting distribution.- Lindley’s equation.- Line.- Linear combination.- Linear equation.- Linear fractional-programming problem.- Linear functional.- Linear equality.- Linear programming Hillier.- Line segment.- Lipschitz.- Little’s law Albin.- Local balance equations.- Local improvement heuristic.- Local maximum.- Local minimum.- Local optimum.- Local solution.- Location analysis ReVelle.- Logic programming.- Logical variables.- Logistics Solomon.- Log-linear model.- Longest-route problem.- Loss function.- Lottery.- Lower-bounded variables.- Lowest index anticycling rules.- LP.- LU matrix decomposition.- MAD.- Maintenance Ushakov.- Makespan.- Malcolm Baldridge award.- Manhattan metric.- Manpower planning Bartholomew.- MAP.- Marginal value (COST).- Marketing Eliashbergl/Lilien/Wind.- Markov chains Harris.- Markov decision processes White.- Markovian arrival process (MAP).- Markov processes Miller.- Markov property.- Markov random field.- Markov renewal process.- Markov routing.- Marriage problem.- Master problem.- Matching Eglese.- Material handling Rosenblatt.- Material requirements planning.- Mathematical model.- Mathematical programming.- Mathematical-programming problem.- Mathematical programming society.- Mathematical-programming system (MPS).- Matrices and matrix algebra Tucker.- Matrix-analytic stochastic models Neuts.- Matrix geometric.- Matrix game.- MAUT.- Max-flow min-cut theorem.- Maximum.- Maximum feasible solution.- Maximum-flow network problem.- Maximum matching problem.- MCDM.- Measureof effectiveness (MOE).- Medicine and medical practice Flagle.- Memoryless property.- Menu planning.- Metagame analysis.- Metamodeling Pressman/Friedman.- Method of stages.- Military operations research Thomas.- MIMD.- Minimum.- Minimum (maximum) feasible solution.- Minimum-cost network-flow problem.- Minimum spanning tree problem.- Minor.- MIP.- MIS.- Mixed-integer programming problem (MIP).- Mixed network.- Model.- Model accreditation Gass.- Model builder’s risk.- Model evaluation Gass.- Model management Krishnan.- Model testing.- Model user’s risk.- Model validation.- Model verification.- MODI.- MOIP.- MOLP.- Monte-Carlo sampling and variance reduction Kleijnen/Rubinstein.- MOR.- MORS.- MRP.- MS.- MSE.- Multi-attribute utility theory Sarin.- Multicommodity network-flow problem.- Multicommodity network flows Shetty.- Multi-criteria decision making (MCDM).- Multidimensional transportation problem.- Multi-echelon inventory systems.- Multi-echelon logistics systems.- Multi-objective linear-programming problem.- Multi-objective programming Steuer.- Multiple criteria decision making Ramesh/Zionts.- Multiple optimal solutions.- Multiple pricing.- Multiplier vector.- Nash saddle-point.- Natural resources Weintraub.- Near-optimal solution.- Neighboring extreme point.- Network.- Network design.- Network optimization Magnanti.- Network planning Rand.- Network simplex algorithm.- Networks of queues Disney.- Neural networks Ignizio/Burke.- Newsboy problem.- Newsvendor problem.- Newton’s method.- NLP.- Node.- Node-arc incidence matrix.- Nonactive (nonbinding) constraint.- Non-Archimedean number.- Nonbasic variable.- Non-compensatory choice strategies.- Nondegenerate basic feasible solution.- Nondonimated solution.- Nonlinear goal programming.- Nonlinear programming Fiacco.-Nonnegative solution.- Nonnegativity conditions.- Non-preemptive.- Nonsingular matrix.- Nontrivial solution.- Nonzero-sum game.- Normative model.- Northwest-corner solution.- NP, NP-complete, NP-hard.- Null matrix.- Null space.- Numerical analysis Nash.- O, o notation.- Objective function.- Object-oriented database.- OEG.- Offered load.- Open network.- Operations Evaluation Group (OEG).- Operations management Vonderembse/Marchal.- Operations Research Office and Research Analysis Corporation Visco/Harris.- Operations Research Society of America (ORSA).- Opportunity cost.- Optimal feasible solution.- Optimality criteria.- Optimal solution.- Optimal value.- Optimal value function.- Optimization.- Optimization of queues.- OR.- Organization Burton/Obel.- Origin node.- OR/MS.- ORO.- ORSA.- Out-of-kilter algorithm.- Output process.- Outside observer distribution.- Overachievement variable.- Overflow process.- Overtaking.- P4.- Packing problem.- Palm measure.- Parallel computing Eckstein.- Parameter.- Parameter-homogeneous stochastic process.- Parametric bound.- Parametric linear programming.- Parametric programming Gal.- Parametric solution.- Pareto-optimal solution.- Partial balance equations.- Partial pricing.- PASTA.- Path.- Payoff function.- Payoff matrix.- PDA.- PDF.- PDSA.- Periodic review.- PERT.- Perturbation.- Perturbation methods.- Petro-chemical industry Baker.- PFI.- Phase I procedure.- Phase II procedure.- Phase-type distribution.- Phase-type probability distributions Neuts.- Piecewise linear function.- Pivot column.- Pivot element.- Pivot row.- Pivot-selection rules.- Po.- Point stochastic processes Ushakov.- Point-to-set-map.- Poisson arrivals.- Poisson process.- Politics Hess/Wong-Martinez.- Pollaczek-Khintchine formula.- Polling system.- Polyhedron.- Polynomial hierarchy.- Polynomially bounded (-time) algorithm (polynomial algorithm).- Polynomial-time.- Polynomial-time reductions and transformations.- Portfolio analysis.- Portfolio theory: mean-variance Board/Ziemba.- POS.- Postoptimal analysis.- Posynomial programming.- Power model.- PP.- PPB(S).- Practice of Operations Research and Management Science Miser.- Precedence diagramming.- Predictive model.- Preemption.- Preemptive priorities.- Preference theory Dyer/Jia.- Prescriptive model.- Prices.- Pricing multipliers.- Pricing out.- Pricing vector.- Primal-dual algorithm.- Primal-dual linear-programming problems.- Primal problem.- Prim’s algorithm.- Prisoner’s dilemma game.- Probabilistic algorithm.- Probabilistic programming.- Probability density function (PDF).- Probability distribution.- Probability distribution selection.- Probability generating function.- Probability integral transformation method.- Problem solving.- Problem structuring methods Rosenhead.- Processor sharing.- Product form.- Product form of the inverse (PFI).- Product-form solution.- Production function.- Production management Bitran/Dasu.- Product-mix problem.- Production rule.- Program evaluation Kaplan/Strauss.- Program evaluation and review technique (PERT).- Project management Rand.- Projection matrix.- Project SCOOP.- Proper coloring.- Prospect theory.- Protocols.- Pseudoconcave function.- Pseudoconvex function.- Pseudoinverse.- Pseudo-polynomial-time algorithm.- Pseudorandom numbers.- Public policy analysis Walker/Fisher.- Pull system.- Pure-integer programming problem.- Push system.- QC.- Q-GERT.- QP.- Quadratic assignment problem.- Quadratic form.- Quadratic-integer programming.- Quadratic programming Murty.- Quadratic-programming problem.- Quality control Alt/Jain.- Quasi-concavefunction.- Quasi-convex function.- Quasi-reversibility.- Queue inference engine Larson.- Queueing discipline.- Queueing networks.- Queueing theory Heyman.- RAC.- Rail freight operations Martland.- RAND corporation Fisher/Walker.- Random field.- Random number generators L’Ecuyer.- Random variates.- Random walk.- Ranging.- Rank.- Rate matrix.- Ray.- R-chart.- R&D.- Readiness.- Reasoning.- Reasoning knowledge.- Recognition problem.- Recourse linear program.- Reduced costs.- Reduced gradient methods.- Redundancy Ushakov.- Redundant constraint.- Regeneration points.- Regression analysis Greenberg.- Relational database.- Relative costs.- Relaxed problem.- Reliability.- Reliability function.- Reliability of systems Gross.- Reneging discipline.- Renewal equation.- Renewal processes Ushakov.- Representation theorem for polyhedral set.- Research Analysis Corporation (RAC).- Research and development Papageorgiou.- Resource aggregation.- Resource leveling.- Resource smoothing.- Response time.- Restricted-basis entry rule.- Retailing Tone.- Revenue equivalence theorem.- Revenue neutrality theorem.- Reversible Markov process.- Revised simplex method.- RHS.- Right-hand-side.- Risk.- Risk assessment Chittister/ Haimes/Harris.- Risk management Chittister/Haimes.- Ritter’s partitioning method.- Robustness analysis.- Rosen’s partitioning method.- Roundoff error.- Route construction heuristic.- Route improvement heuristic.- Row vector.- Rule.- Rule set.- Running time of an algorithm.- SA.- Saddle-point of a function.- Saddle-point of a game.- Saddlepoint problem.- St. Petersburg paradox.- Safety Ushakov.- Sand table battle model.- Satisficing.- Scaling.- Scenario.- Scenario analysis.- SCERT.- Scheduling and sequencing Magazine.- Score functions Rubinstein/Shapiro/Uryasev.- Scoringmodel.- Scripted battle model.- Search theory Stone.- 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 systems.- Set-covering problem.- Set-partitioning problem.- SEU.- Shadow prices.- Shapley value.- Shell.- Shewhart chart.- Shortest-route problem.- Signomial programming.- SIMD.- Simple upper-bounded problem (SUB).- Simplex.- Simplex method (algorithm).- Simplex multipliers.- Simplex tableau.- Simulated annealing Anandalingam.- Simulation of discrete-event stochastic systems Gross.- Simulator.- Single-server network.- Singular matrix.- Sink node.- SIRO.- Skew-symmetric matrix.- Slack variable.- Slack vector.- SLP.- S-model.- Smooth patterns of production.- Soft systems methodology (SSM).- Sojourn time.- Solution.- Solution space.- SOS.- Source node.- Space Evans.- Spanning tree.- Sparse matrix.- Sparsity.- Special-ordered sets (SOS).- Splines Johnson.- Sports Ladany.- Spreadsheets Plane.- SQC.- Square root law.- ST.- Stages.- Staircase structure.- Stanford-B model.- Stationary distribution.- Stationary stochastic process.- Stationary transition probabilities.- Statistical equilibrium.- Statistical process control.- Steady state.- Steady-state distribution.- Steepest descent method.- Steiner tree problem.- Stepping-stone method.- Stigler’s diet problem.- Stochastic duel.- Stochastic model.- Stochastic process.- Stochastic programming King.- Strategic assumption surfacing and testing (SAST).- Strategic choice.- Strategic options development and analysis (SODA).- Strictly quasi-concave function.- Strictly quasi-convex function.-Strong duality theorem.- Strongly NP-complete (NP-hard).- Strongly polynomial-time algorithm.- Structural variables.- Structured modeling Geoffrion.- Subjective probability.- Suboptimization.- SUB problem.- Super-sparsity.- Supplemental variables.- Surplus variable.- Surplus vector.- Symmetric matrix.- Symmetric network.- Symmetric primal-dual problems.- Symmetric zero-sum two-person game.- System.- System dynamics Richardson.- System reliability.- Systems analysis Mason/Conger.- Tableau.- Tabu search Glover.- Takuchi loss function.- Tandem queues.- Technological coefficients.- Telecommunication networks.- Terminal.- The Institute of Management Sciences (TIMS).- Theorem of alternatives.- Thickness.- Time/cost trade-offs.- Time series analysis Mastrangelo/Montgomery.- Time-stepped simulation.- Time-tabling.- TIMS.- Tolerance analysis.- Total float.- Total quality management Ramberg.- TQC.- TQM.- Traffic analysis Gazis.- Traffic equations.- Traffic intensity.- Traffic process.- Transfer function.- Transient analysis.- Transition function.- Transition matrix.- Transition probabilities.- Transportation problem.- Transportation problem paradox.- Transportation simplex (primal-dual) method.- Transposition theorems.- Transshipment problem.- Traveling salesman problem Hoffman/Padberg.- Tree.- Triangular matrix.- Trim problem.- Trivial solution.- Truck dispatching.- Truckload (TL) shipment.- TS.- TSP.- Tucker tableau.- Two-phase simplex method.- Unary NP-complete (NP-hard).- Unbalanced transportation problem.- Unbalanced optimal solution.- Unconstrained optimization Sofer.- Unconstrained solution.- Uncontrollable variables.- Underachievement variable.- Undetermined system of linear equations.- Undirected arc.- Unimodular matrix.- Unique solution.- Unrestricted variable.- Unsymmetric primal-dual problems.- Upper-bounded problems.- Urban services Chelst.- Utility function.- Utility theory Fishburn.- Vacation model.- Vacation time.- Validation.- Value function.- VAM.- Variance reduction.- Vector maximum problem.- Vector optimization problem.- Vector space.- Vehicle routing Bodin.- Vehicle scheduling.- Verification.- Verification, validation and testing of models Balci.- VERT.- Vertex.- Virtual reality.- Visualization Bell.- Vogel’s approximation method (VAM).- Von Neumann-Morgenstern (expected) utility theory.- Voronoi constructs Beichl/Bernal/Witzgall/Sullivan.- Voronoi diagram.- VV&A.- VV&T.- Waiting time.- War game.- Warehouse problem.- Water resources Krzysztofowicz.- Weak duality theorem.- Weakly-coupled systems.- Weber problem.- Wilkinson equivalent random technique.- WIMP.- Wolfe’s quadratic-programming problem algorithm.- Work schedule.- Worst-case analysis.- X-bar chart.- Yield management Mason/Conger.- Zero-one goal programming.- Zero-one variables.- Zero-sum.- Zero-sum game.- Zero-sum two-person game.

Artikel entfernen

KI-Beratung Beta

Encyclopedia of Operations Research and Management Science

Beschreibung

Produktdetails

Einband

Erscheinungsdatum

Abbildungen

Herausgeber

Verlag

Seitenzahl

Maße (L/B/H)

Gewicht

Auflage

Sprache

ISBN