Construction of the Unique Saturated Resolution V Design in 256 Runs

摘要

The paper investigates the problem of how many variables can be accommodated in a 2 sub v k-p design in 256 runs. The problem is solved through the application of methods given by the authors in a previous paper (Draper and Mitchell (1966)) to the particular case R = 5, q = k - p = 8. The problem of obtaining optimally blocked designs for each value of k is also solved. (Author)