zbMATH — the first resource for mathematics

Further results on orthogonal array plus one run plans. (English) Zbl 1127.62386
Summary: This paper considers the issue of optimality of orthogonal array plus one run plans under generalized criteria of type 1 which include the D-, A-, and E-criteria. Our results, in conjunction with those of R. Mukerjee [Ann. Stat. 27, No. 1, 82–93 (1999; Zbl 0932.62083)] cover all orthogonal arrays of strength two and involving up to 100 rows, except perhaps those having 72 rows, and thus almost completely settle the problem for resolution III plans over a practical range.

MSC:
 62K05 Optimal statistical designs 62K15 Factorial statistical designs
Full Text:
References:
 [1] Cheng, C.S., Orthogonal arrays with variable numbers of symbols, Ann. statist., 8, 447-453, (1980) · Zbl 0431.62048 [2] Cheng, C.S., Optimality of some weighing and 2^n fractional factorial designs, Ann. statist., 8, 436-446, (1980) · Zbl 0425.62055 [3] Collombier, D., Optimality of some fractional factorial designs, (), 39-45 [4] Kolyva-Machera, F., D-optimality in 3^k designs for $$N≡ 1 mod9$$ observations, J. statist. plann. inference, 22, 95-103, (1989) · Zbl 0669.62061 [5] Mukerjee, R., Universal optimality of fractional factorial plans derivable through orthogonal arrays, Calcutta statist. assoc. bull., 31, 63-68, (1982) · Zbl 0503.62071 [6] Mukerjee, R., On E-optimal fractions of symmetric and asymmetric factorials, Statist. sinica, 5, 515-533, (1995) · Zbl 0828.62065 [7] Mukerjee, R., 1999. On the optimality of orthogonal array plus one run plans. Ann. Statist. 27, 82-93. · Zbl 0932.62083 [8] Wang, J.C.; Wu, C.F.J., An approach to the construction of asymmetrical orthogonal arrays, J. amer. statist. assoc., 86, 450-456, (1991)
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.