Title

A note on Morris' bound for search designs

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

Share

COinS