A note on Morris' bound for search designs

Lih Yuan Deng, Dennis K.J. Lin

Research output: Contribution to journalArticle

Abstract

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

Original languageEnglish (US)
Pages (from-to)203-204
Number of pages2
JournalJournal of Statistical Planning and Inference
Volume74
Issue number1
StatePublished - Oct 1 1998

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A note on Morris' bound for search designs'. Together they form a unique fingerprint.

  • Cite this