Some sufficient conditions for the type 1 optimality of block designs

In this paper, we investigate the problem of determining block designs which are optimal under type 1 optimality criteria within various classes of designs having υ treatments arranged in b blocks of size k. The solutions to two optimization problems are given which are related to a general result obtained by Cheng (1978) and which are useful in this investigation. As one application of the solutions obtained, the definition of a regular graph design given in Mitchell and John (1977) is extended to that of a semi-regular graph design and some sufficient conditions are derived for the existence of a semi-regular graph design which is optimal under a given type 1 criterion. A result is also given which shows how the sufficient conditions derived can be used to establish the optimality under a specific type 1 criterion of some particular types of semi- regular graph designs having both equal and unequal numbers of replicates. Finally,some sufficient conditions are obtained for the dual of an A- or D-optimal design to be A- or D-optimal within an appropriate class of dual designs.     

Balanced incomplete Latin square designs

Latin squares have been widely used to design an experiment where the blocking factors and treatment factors have the same number of levels. For some experiments, the size of blocks may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Latin squares (BILS) is proposed. A general method for constructing BILS is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Latin squares. The optimality of the proposed BILS designs is investigated. It is shown that the proposed transversal BILS designs are asymptotically optimal for all the row, column and treatment effects. The relative efficiencies of a delete-one-transversal BILS design with respect to the optimal designs for both cases are also derived; it is shown to be close to 100%, as the order becomes large.     

A characterization of a universally optimal design within a class of block designs

It is shown that within the class of connected binary designs with arbitrary block sizes and arbitrary replications only a symmetic balanced incomplete block design produces a completely symmetric information matrix for the treatment effects whenever the number of blocks is equal to the number of treatments and the number of experimental units is an integer multiple of the number of treatments. Such a design is known to be universally optimal.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

The Construction of Efficient Two-replicate Row–Column Designs for Use in Field Trials

Two-replicate row–column designs are often used for field trials in multisite tree or plant breeding programmes. With only two replicates for each trial, it is important to use designs with optimal or near optimal efficiency factors. This paper presents an algorithm for generating such designs. The method extends the contraction approach of Bailey and Patterson to any set of parameters and uses the factorial design construction algorithm of Williams and John to generate designs. Our experience with the algorithm is that it produces designs that are at least as good as, and often much better and more quickly generated than, those obtained by other recent computer algorithms.     

On the optimality of a class of minimal covering designs

It is shown that the minimal covering designs for v=6t+5 treatments in blocks of size 3 are optimal w.r.t. a large class of optimality criteria. This class of optimality criteria includes the well-known criteria of A-, D- and E-optimality. It is conjectured that these designs are also optimal w.r.t. other criteria suggested by Takeuchi (1961).     

Optimal regular graph designs

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). To explore the landscape of designs with a large number of blocks, we introduce extensions of regular graph designs. These are constructed by adding the blocks of a balanced incomplete block design repeatedly to the original design. We present the results of an exact computer search for the best regular graph designs and the best extended regular graph designs with up to 20 treatments v, block size \(k \le 10\) and replication r \(\le 10\) and \(r(k-1)-(v-1)\lfloor r(k-1)/(v-1)\rfloor \le 9\).     

Minimum breakdown designs in blocks of size two

In scientific investigations, there are many situations where each two experimental units have to be grouped into a block of size two. For planning such experiments, the variance-based optimality criteria like A-, D- and E-criterion are typically employed to choose efficient designs, if the estimation efficiency of treatment contrasts is primarily concerned. Alternatively, if there are observations which tend to become lost during the experimental period, the robustness criteria against the unavailability of data should be strongly recommended for selecting the planning scheme. In this study, a new criterion, called minimum breakdown criterion, is proposed to quantify the robustness of designs in blocks of size two. Based on the proposed criterion, a new class of robust designs, called minimum breakdown designs, is defined. When various numbers of blocks are missing, the minimum breakdown designs provide the highest probabilities that all the treatment contrasts are estimable. An exhaustive search procedure is proposed to generate such designs. In addition, two classes of uniformly minimum breakdown designs are theoretically verified.     

Optimal Designs for Random Coefficient Regression Models with Heteroscedastic Errors

The purpose of this article is to present the optimal designs based on D-, G-, A-, I-, and D _β-optimality criteria for random coefficient regression (RCR) models with heteroscedastic errors. A sufficient condition for the heteroscedastic structure is given to make sure that the search of optimal designs can be confined at extreme settings of the design region when the criteria satisfy the assumption of the real valued monotone design criteria. Analytical solutions of D-, G-, A-, I-, and D _β-optimal designs for the RCR models are derived. Two examples are presented for random slope models with specific heteroscedastic errors.     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

Optimal blocked main effects plans

In this paper, we consider the construction of optimal blocked main effects designs where m two-level factors are to be studied in N runs which are partitioned into b blocks of equal size. For N ≡ 2±od4 sufficient conditions are derived for a design to be Φ _f optimal among all designs having main effects occurring equally often at their high and low levels within blocks and then this result is extended to the class of all designs for the case when the block size is two. Methods of constructing designs satisfying the sufficient conditions derived are also given.     

Some sufficient conditions for establishing (M,S)-optimality

Two sufficient conditions are given for an incomplete block design to be (M,S- optimal. For binary designs the conditions are (i) that the elements in each row, excluding the diagonal element, of the association matrix differ by at most one, and (ii) that the off-diagonal elements of the block characteristic matrix differ by at most one. It is also shown how the conditions can be utilized for nonbinary designs and that for blocks of size two the sufficient condition in terms of the association matrix can be attained.     

Designs for cropping systems research

The present article establishes equivalence between extended group divisible (EGD) designs and designs for crop sequence experiments. This equivalence has encouraged the agricultural experimenters to use EGD designs for their experimentation. Some real life applications of EGD designs have been given. It has also been shown that several existing association schemes are special cases of EGD association scheme. Some methods of construction of EGD designs are also given. A catalogue of EGD designs obtainable through methods of construction along with efficiency factors of various factorial effects is also presented. In some crop sequence experiments that are conducted to develop suitable integrated nutrient supply system of a crop sequence, the treatments do not comprise of a complete factorial structure. The experimenter is interested in estimating the residual and direct effect of the treatments along with their cumulative effects. For such experimental settings block designs with two sets of treatments applied in succession are the appropriate designs. The correspondence established between row–column designs and block designs for two stage experiments by Parsad et al. [2003. Structurally incomplete row–column designs. Comm. Statist. Theory Methods 32(1), 239–261] has been exploited in obtaining designs for such experimental situations. Some open problems related to designing of crop sequence experiments are also given.     

Cubic lattices

In some experiments, the problem is to compare many unstructured treatments in small blocks, the classical example being the study of new plant varieties on variable land. A common method is to use lattice designs, i.e. block designs based upon rows and columns of a square format, with ficrther replicates being formed, required, from orthogonal squares applied to the format. It has been known for some time that cubes can be used instead; this paper sets out to explore the possibilities. There are two cases. In one case, the blocks are formed from the planes of the cube and, in the other case, from its lines. The cubic lattice basically has three replicates-one from each dimension-but, two or four replicates are required, a design can be found by omitting or duplicating one of the dimensions. Where standard treatments need to be introduced, -a useful device is to reinforce, i.e. supplement each block with additional plots of standards, with each block of a replicate being supplemented in the same way. These possibilities are examined. It emerges that cubic lattices with two or three replicates usefully extend the range of available designs, but that those with four replicates are disappointing. However, there is the alternative of using designs based upon Latin cubes. This matter is not taken far but it is shown that, where the Latin cube exists, it gives a better design. A quick way of calculating an approximate analysis of variance is given, which is applicable in a wide range of cases.     

Proper generalized neighbor designs in circular blocks

Generalized neighbor designs relax the condition of constancy on the number of times two treatments occur as neighbors in a design. In this paper, we constructed generalized neighbor designs in circular blocks of equal size. Catalogs of these designs for block size 5, 7 and 9 are also compiled. All the designs given here are binary.     

Efficient circular neighbour designs for spatial interference model

We consider circular block designs for field-trials when there are two-sided spatial interference between neighbouring plots of the same blocks. The parameter of interest is total effects that is the sum of direct effect of treatment and neighbour effects, which correspond to the use of a single treatment in the whole field. We determine universally optimal approximate designs. When the number of blocks may be large, we propose efficient exact designs generated by a single sequence of treatment. We also give efficiency factors of the usual binary block neighbour balanced designs which can be used when the number of blocks is small.     

On Second-Order A-, D- and E-Minimax Designs for Estimating Slopes in Extrapolation and Restricted Interpolation Regions

Summary

The concepts of D-, A- and E-minimax optimality criteria of designs for estimating the slopes of a response surface are considered for situations where the region of interest may not be identical to the experimental region. Optimal second-order designs are derived for the situation where the experimental region and the region of interest are both hyperspherical with a common centre. The dependence of the optimal design on the relative sizes of the regions is investigated. Further, the perfomance of designs optimal for one region in estimating slopes in other regions is also examined.     

Optimal designs for experiments with mixtures: a survey

This is a survey article on known results about analytic solutions and numerical solutions of optimal designs for various regression models for experiments with mixtures. The regression models include polynomial models, models containing homogeneous functions, models containing inverse terms and ratios, log contrast models, models with quantitative variables, and mod els containing the amount of mixture, Optimality criteria considered include D-, A-, E-,φ_p- and I_λ-Optimalities. Uniform design and uniform optimal design for mixture components, and efficiencies of the {q,2} simplex-controid design are briefly discussed.     

Families of proper generalized neighbor designs

A generalized neighbor design relaxes the equality condition on the number of times two treatments occur as neighbors in the design. In this article we have constructed a new series of generalized neighbor designs with equal block sizes, a series of neighbor designs of Rees [1967. Some designs of use in serology. Biometrics 23, 779–791] and a series of neighbor designs with two distinct block sizes. Two more new series of GN₂ designs are also constructed for even number of treatments. It has been shown that quasi neighbor designs introduced by Preece [1994. Balanced Ouchterlony neighbor designs. J. Combin. Math. Combin. Comput. 15, 197–219] are special cases of generalized neighbor designs with t=2$t=2$. All the designs given here are binary. A new definition—partially balanced circuit design is introduced which is a special case of generalized neighbor designs with binary blocks.