We specify an algorithm to enumerate a minimum complete set of combinatorially non-isomorphic orthogonal arrays of given strength, run-size, and numbers of factor levels. We consider the classification of arrays according to several criteria of practical interest, differentiated according to the strength of the arrays. We exemplify classification using several series of mixed arrays, and we propose to discard arrays that are inadmissible according to the criteria.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number
2007021.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: