Optimal Incomplete Block Designs

Abstract

Summary The class of regular graph (RG) designs, conjectured to be optimal among all incomplete block designs, is defined. The results of a systematic search of the class of RG designs are given for all cases in which v ≤ 12, r ≤ 10 and v ≤ b. In nearly every case, the optimum design is determined for each of the three optimality criteria: A, D and E. For v > b, we present the duals of the optimal designs for v < b. Many of the designs are new and these are tabulated in a back-up report.