A note on Morris' bound for search designs

Authors

Lih Yuan Deng, University of Memphis
Dennis K.J. Lin, Pennsylvania State UniversityFollow

Abstract

A lower bound is given for the number of experimental runs required in search designs for two-level orthogonal array of strength one.

Publication Title

Journal of Statistical Planning and Inference

Recommended Citation

Deng, L., & Lin, D. (1998). A note on Morris' bound for search designs. Journal of Statistical Planning and Inference, 74 (1), 203-204. https://doi.org/10.1016/s0378-3758(98)00099-8