(365d) New and Efficient Interval Sampling Method for Use of P-Boxes in Off-Line Quality Control
AIChE Annual Meeting
2022
2022 Annual Meeting
Computing and Systems Technology Division
Interactive Session: Systems and Process Operations
Tuesday, November 15, 2022 - 3:30pm to 5:00pm
Risk analysts recognize two fundamentally distinct forms of uncertainty. The first is the variability that arises from environmental stochasticity, inhomogeneity of materials, fluctuations in time, variation in space, or heterogeneity or other differences among components or individuals. Variability is sometimes called Type I uncertainty, or less cryptically, aleatory uncertainty to emphasize its relation to the randomness in gambling and games of chance. It is also sometimes called irreducible uncertainty because, in principle, it cannot be reduced by further empirical study (although it may be better characterized). The second kind of uncertainty is the incertitude of scientific ignorance, measurement uncertainty, unobservability, censoring, or other lack of knowledge. This is sometimes called Type II uncertainty or simply epistemic uncertainty. In contrast with aleatory uncertainty, epistemic uncertainty is sometimes called reducible uncertainty because an additional empirical effort can generally reduce it. For situations in which the uncertainty about quantities is purely aleatory, probability theory is usually preferred. However, when strictly epistemic uncertainties, or both aleatory and epistemic uncertainties, are present several researchers have converged on essentially the same idea: that one can work with bounds on probability for this purpose. In the 1990s, researchers introduced interval-type bounds on cumulative distribution functions, which have been called "probability boxes" or "p-boxes" for short [2,3,8]. Uncertainty propagation for uncertainties described by probability distributions is generally carried out using sampling techniques. For p-box uncertainties, researchers use interval Monte Carlo for propagation [1,6,7]. However, this method is computationally intensive. Recently, we developed and evaluated five new efficient interval sampling techniques for P-boxes. These sampling techniques are derived from quasi-Monte Carlo sequences like Hammersley and Sobol sequences, uniformity theory, and interval mathematics. These sampling techniques are evaluated using various functions of two to 800 uncertain variables defined by p-box uncertainties. Heuristics for selecting an efficient sampling technique based on the number of uncertainties is presented [5].
In this paper, we present a real-world example of quality control of a CSTR using one of the efficient sampling techniques presented earlier and is applicable to this problem [6]. The example illustrates how a change in estimates of uncertainty can affect the optimal quality control designs.
References
- Dige N. and U. Diwekar (2018), "An Efficient sampling algorithm for large-scale optimization under uncertainty problems", Computers and Chemical Engineering, 115, 431.
- A. Enszer, Y. Lin, S. Ferson, G. F. Corliss, M. A. Stadtherr, âProbability bounds analysis for nonlinear dynamic process modelsâ, AIChE J. 57 (2011) 404â422.
- Ferson, J. G. Hajagos, âArithmetic with uncertain numbers: Rigorous and (often) best possible answersâ, Reliab. Eng. Syst. Safe. 85 (2004) 135â152.
- Kalagnanam J. and U. Diwekar, "An Efficient Sampling Technique for Off-line Quality Control" (1997), Technometrics, 38, 308.
- Kochumani P., U. Diwekar, and M. Stadtherr (2021), "New and Efficient Interval Sampling Methods for P-box Uncertainties", Paper presented in AIChE annual meeting, Boston.
- Taguchi, G., and Wu, Y. (1980), Introduction to Off-line Quality Control, Papageorgiou, A., and Wasilkowski, G. W. (1990), "On Average Case Com- Nagoya, Japan: Central Japan Quality Control.
- Wang R., U. Diwekar, and C. Gregoire-Padro, "Latin Hypercube Hammersley Sampling for Risk and Uncertainty Analysis", (2004), Environmental Progress., 23, 141.
- Williamson RC, Downs T. âProbabilistic arithmetic I. Numerical methods for calculating convolutions and dependency boundsâ, Int J Approx Reason. 1990;4:89â158.