IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v46y2017i6p2724-2735.html
   My bibliography  Save this article

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

Author

Listed:
  • Tian-Fang Zhang
  • Jian-Feng Yang
  • Zhi-Ming Li
  • Run-Chu Zhang

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.

Suggested Citation

  • Tian-Fang Zhang & Jian-Feng Yang & Zhi-Ming Li & Run-Chu Zhang, 2017. "Construction of regular 2n41 designs with general minimum lower-order confounding," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(6), pages 2724-2735, March.
    • Handle: RePEc:taf:lstaxx:v:46:y:2017:i:6:p:2724-2735
    DOI: 10.1080/03610926.2015.1048887
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2015.1048887
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2015.1048887?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:46:y:2017:i:6:p:2724-2735. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.