# zbMATH — the first resource for mathematics

Bounds on the maximum number of clear two-factor interactions for $$2^{m-p}$$ designs of resolution III and IV. (English) Zbl 0999.62059
Summary: The authors derive upper and lower bounds on the maximum number of clear two-factor interactions in $$2^{m-p}$$ fractional factorial designs of resolution III and IV. A two-factor interaction is said to be clear if it is not aliased with any main effect or with any other two-factor interactions. The lower bounds are obtained by exhibiting specific designs. By comparing the bounds with the values of the maximum number of clear two-factor interactions in cases where it is known, one concludes that the construction methods perform quite well.

##### MSC:
 62K15 Factorial statistical designs 62K25 Robust parameter designs
Full Text:
##### References:
 [1] Addelman, Symmetrical and asymmetrical fractional factorial plans, Technometrics 1 pp 47– (1962) · Zbl 0116.36704 [2] Chen, 2n-m designs with resolution III or IV containing clear two-factor interactions, Journal of Statistical Planning and Inference 75 pp 147– (1998) · Zbl 0938.62081 [3] Chen, A catalogue of two-level and three-level fractional factorial designs with small runs, International Statistical Review 61 pp 131– (1993) · Zbl 0768.62058 [4] Cheng, Minimum aberration and model robustness for two-level fractional factorial designs, Journal of the Royal Statistical Society Series B 61 pp 85– (1999) · Zbl 0913.62072 [5] Draper, Capacity considerations for two-level fractional factorial designs, Journal of Statistical Planning and Inference 24 pp 25– (1990) · Zbl 0685.62059 [6] Fries, Minimum aberration 2k-p designs, Technometrics 22 pp 601– (1980) · Zbl 0453.62063 [7] D. X. Sun (1993). Estimation Capacity and Related Topics in Experimental Designs. Unpublished doctoral disseration, University of Waterloo, Waterloo, ON, Canada. [8] Wu, A graph-aided method for planning two-level experiments when certain interactions are important, Technometrics 34 pp 162– (1992)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.