3
- https://doi.org/10.1007/978-3-642-58988-1_10
Asymptotic Upper Bounds for the Optimal Design Length in Factor Screening Experiments
- Jan 1, 1998
- A A Zhigljavsky
Abstract
For certain families of discrete search problems upper bounds for the length of optimal non-sequential designs can written in the form \(N(n) = \min \left\{ {k = 1,2, \ldots :\sum _{{i = 1}}^{I}{{q}_{{i,n}}}r_{{i,n}}^{k} < 1} \right\}\) for suitable values of I, q i,n and r i,n and n → ∞. We prove a general result allowing us in many particular cases to get the asymptotic law for N (n),n → ∞. We then apply this result to derive asymptotic upper bounds for the optimal design length in the problem of binary screening.Keywordsfactor screeningbinary modelexistence theoremsexperimental designsignificant factors
- # Factor Screening Experiments
- # Optimal Length
- # Optimal Design
- # Discrete Problems
- # Asymptotic Upper Bounds
- # Discrete Search Problems
- # Non-sequential Designs
- # Discrete Search
- # Asymptotic Law
- # Screening Experiments