Construction of optimal fractional Order-of-Addition designs via block designs
Jianbin Chen,
Rahul Mukerjee and
Dennis K.J. Lin
Statistics & Probability Letters, 2020, vol. 161, issue C
Abstract:
Order of addition (OofA) experiments have found wide applications. Each order (run) of an OofA experiment is a permutation of m(≥2) components. It is typically infeasible to compare all the m! possible runs, especially when m is large. This calls for experimentation with a subset or fraction of these m! runs. However, only a few systematic results are available on the construction of such fractions ensuring optimality. We employ block designs to propose a systematic combinatorial construction method for optimal fractional OofA designs, and extend the method to construct highly efficient OofA designs, both in much smaller run sizes than the currently available optimal fractions.
Keywords: Balanced incomplete block design; Fractional OofA design; Optimality; Pairwise order model; Systematic combinatorial construction (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715220300316
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:161:y:2020:i:c:s0167715220300316
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
DOI: 10.1016/j.spl.2020.108728
Access Statistics for this article
Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul
More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().