scientific article; zbMATH DE number 1145157
output analysisperturbation analysisrandom number generationrare events simulationresponse surface methodologysensitivity analysisstochastic optimizationvariance reduction
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to systems and control theory (93-01)
This book is divided into two parts, I: Conventional simulation and II: Modern simulation. As the title indicates, the first part treats the most basic parts of simulation analysis like random number generation, output analysis with particular emphasis on steady-state simulation (batch means, regenerative simulation etc.) and variance reduction techniques (common random numbers, antithetic sampling, control variates, conditional Monte Carlo and stratification). In addition, the TES (transform-expand-sample) methodology for generating correlated sequences as developed by the second author [e.g. ORSA J. Comput. 3, No. 4, 317-329 (1991; Zbl 0764.65002)] is exposed. The second part deals with more recent developments, in particular sensitivity analysis: how does one quantify by simulation the effects of small perturbations of systems parameters. The exposition concentrates here on the score function method, to which the first author has made numerous contributions; see in particular the earlier book by the first author and \textit{A. Shapiro} [``Discrete events systems. Sensitivity analysis and stochastic optimization by the score function method (1993; Zbl 0805.93002)], henceforth abbreviated as RS. The idea is to express the performance measure in terms of likelihood ratios and differentiate under the integral sign to get the sensitivities, which contrast the sample path differentiation used in infinitesimal perturbation analysis, e.g. \textit{P. Glasserman} [``Gradient estimation via perturbation analysis (1991; Zbl 0746.90024)]. The advantage of the score function method is largely that it applies to a larger class of problems. In the book, static problems (e.g., mean shortest paths in PERT networks) and dynamic problems (e.g., queueing performance and manufacturing systems) are treated separately. A further distinction is made between distributional parameters like exponential rates, normal means and variances etc., and structural parameters like the levels \(s\), \(S\) in an \((s,S)\) inventory model. In the case of structural parameters, the basic absolute continuity requirements for the score function method are often violated, and a method (`push-out') for solving this problem is described. Part II further deals with response surface methodology (how to obtain smooth estimates of performance measures for not one but several sets of parameters), stochastic optimization, and rare events simulation (how does one obtain simulation estimators of small probabilities which have good complexity properties in the sense that the relative error remains almost bounded as the rare events probability goes to zero). The book has considerable overlap with the RS book quoted above, and in fact, large parts are very close. Compared to RS, the present book puts less emphasis on stochastic optimization and is considerably broader in its choice of topics. Because of this broadness, the book will serve as a valuable textbook for students in operations research, industrial engineering and management science.
- Rare event probabilities in stochastic networks
- Permuted derivative and importance-sampling estimators for regenerative simulations.
- Modeling and simulation in industrial engineering
- Moment-based estimation for parameters of general inverse subordinator
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
- Modeling data envelopment analysis by chance method in hybrid uncertain environments
- How many needles are in a haystack, or how to solve \#P-complete counting problems fast
- A Gibbs sampler on the \(n\)-simplex
- On construction and simulation of count data models
- A tutorial on the cross-entropy method
- The cross-entropy method for network reliability estimation
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation
- Perturbation analysis of inhomogeneous finite Markov chains
- Modeling and simulation of discrete event systems
- Stochastic analysis of maintenance process costs in the IT industry: a case study
- Modeling and simulation
- scientific article; zbMATH DE number 439951 (Why is no real title available?)
- Modeling and tools for network simulation
- Conceptual modeling for discrete simulation
- Simplex partitioning via exponential clocks and the multiway-cut problem
- HEAVY TAILS, IMPORTANCE SAMPLING AND CROSS–ENTROPY
- The comparison of structured modeling and simulation modeling of queueing systems
- Optimal multivariate quota-share reinsurance: a nonparametric mean-CVaR framework
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- A neural network approach to performance analysis of tandem lines: the value of analytical knowledge
- A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
- Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes
- A physics and data co-driven surrogate modeling method for high-dimensional rare event simulation
- On three competing maintenance actions and the related condition control
- Resource allocation in stochastic, finite-capacity, multi-project systems through the cross entropy methodology
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384475)