Premium
AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS
Author(s) -
Nguyen NamKy,
Williams E.R.
Publication year - 1993
Publication title -
australian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 41
eISSN - 1467-842X
pISSN - 0004-9581
DOI - 10.1111/j.1467-842x.1993.tb01344.x
Subject(s) - column (typography) , construct (python library) , algorithm , row and column spaces , replicate , mathematics , computer science , mathematical optimization , row , statistics , geometry , programming language , connection (principal bundle)
Summary This paper describes an effective algorithm for constructing optimal or near‐optimal resolvable row‐column designs (RCDs) with up to 100 treatments. The performance of this algorithm is assessed against 20 2‐replicate resolvable RCDs of Patterson & Robinson (1989) and 17 resolvable RCDs based on generalized cyclic designs (GCDs) of Ipinyomi & John (1985). The use of the algorithm to construct RCDs with contiguous replicates is discussed.