Evaluating Best-Case and Worst-Case Variances When Bounds are Available
暂无分享,去创建一个
This paper describes procedures for computing the tightest possible best-case and worst-case bounds on the variance of a discrete, bounded, random variable when lower and upper bounds are available for its unknown probability mass function. An example from the application of the Monte Carlo method to the estimation of network reliability illustrates the procedures and, in particular, reveals considerable tightening in the worst-case bound when compared to the trivial worst-case bound based exclusively on range.
[1] J. Scott Provan,et al. Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.
[2] George S. Fishman,et al. A monte carlo sampling plan for estimating reliability parameters and related functions , 1987, Networks.
[3] Charles J. Colbourn,et al. Combining monte carlo estimates and bounds for network reliability , 1990, Networks.
[4] George L. Nemhauser,et al. Matroids and a Reliability Analysis Problem , 1979, Math. Oper. Res..