ABSTRACT
This article considers the design performance of orthogonal arrays in which one or more runs are missing at random. We focus on orthogonal arrays of index unity and on the 18 run ternary arrays.
Acknowledgments
We thank the referees and the associate editor for their critical comments on an earlier version.