EconPapers    
Economics at your fingertips  
 

Construction of regular 2n41 designs with general minimum lower-order confounding

Tian-Fang Zhang, Jian-Feng Yang, Zhi-Ming Li and Run-Chu Zhang

Communications in Statistics - Theory and Methods, 2017, vol. 46, issue 6, 2724-2735

Abstract: Mixed-level designs, especially two- and four-level designs, are very useful in practice. In the last two decades, there are quite a few literatures investigating the selection of this kind of optimal designs. Recently, the general minimum lower-order confounding (GMC) criterion (Zhang et al., 2008) gave a new approach for choosing optimal factorials. It is proved that the GMC designs are more powerful than other criteria in the widely practical situations. In this paper, we extend the GMC theory to the mixed-level designs. Under the theory we establish a new criterion for choosing optimal regular two- and four-level designs. Further, a construction method is proposed to obtain all the 2n41 GMC designs with N/4 + 1 ⩽ n + 2 ⩽ 5N/16, where N is the number of runs and n is the number of two-level factors.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2015.1048887 (text/html)
Access to full text is restricted to subscribers.

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:taf:lstaxx:v:46:y:2017:i:6:p:2724-2735

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2015.1048887

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:lstaxx:v:46:y:2017:i:6:p:2724-2735