Optimal variance- and efficiency-balanced designs for one- and two-way elimination of heterogeneity

Summary In this paper, a series ofE-optimal non-binary variance balanced (block or row-column) designs and a series ofE-optimal non-binary efficiency balanced (block or row-column) designs are provided in certain broad classes of competing designs. Furthermore, their high efficiencies by the usualA- andD-optimality criteria are shown.     

A note on theE-optimality of block designs

Summary In this paper we consider the problem of determiningE-optimal block designs for experimental situations in whichv treatments are to be tested onn experimental units arranged inb blocks and where the block sizes and number of replications assigned to the treatments are allowed to vary. Some sufficient conditions are obtained for designs to beE-optimal in these situations and methods for constructing designs which satisfy the sufficient conditions given are also derived.     

A class of non binary unequally replicatedE-optimal designs

In a situation where the given set of parameters (b, k andv) precludes the existence of any known optimal block designs, but an optimal block design is known to exist with parametersb, k andv*>v, a new design is shown to be useful. This (b, k, v) design is obtained from the (b, k, v*) optimal design by collapsing the classes of a suitable paritition of the treatment set (of the latter design) to treatments (of the former). We call the new design a quotient of the original design. Although the quotient is non binary and unequally replicated, it turns out to beE-optimal within the class of all proper and connected designs withb, k andv, provided the replication number of the optimal design we start with is not too large.     

Optimal block designs for diallel crosses

Dey and Midha (Biometrika 83(2):484–489, 1996) constructed optimal block designs for complete diallel cross experiment using triangular partially balanced incomplete block designs with two associate classes. They listed optimal block designs for the lines in the range from 5 ≤ v ≤ 10. In this paper, we are also proposing additional optimal block designs for complete diallel cross experiment using two associate class partially balanced block designs for some additional values of v. Our method yields designs for proper and non-proper settings for complete diallel cross experiments. The proper and non proper designs are optimal in the sense of Kempthorne (Genetics 41:451–459, 1956) and non-proper designs are universally optimal in the sense of Kiefer (A survey of statistical design and linear models, North Holland, Amsterdam, 1975). The list of practically important designs is also given.     

On the E-optimality of truncated block designs

Sufficient conditions are found for designs, derived from completely symmetric designs by deleting binary blocks, to be E-optimal. Sufficient conditions are also found for E-optimality of designs obtained from other E-optimal designs by deleting all blocks forming a balanced incomplete block design on a subset of the treatments. The results include many binary and non-binary designs for which E-optimality was previously unknown.     

Totally positive regression: E-optimal designs

E-optimality of approximate designs in linear regression models is paired with a dual problem of nonlinear Chebyshev approximation. When the regression functions form a totally positive system, then the information matrices of designs for subparameters turn out to be “almost” totally positive, a property which allows to solve the nonlinear Chebyshev problem. Thereby we obtain explicit formulae for E-optimal designs in terms of equi-oscillating generalized polynomials. The considerations unify and generalize known results on E-optimality for particular regression setups.     

On the construction of <Emphasis Type="Italic">E</Emphasis>(<Emphasis Type="Italic">s</Emphasis><Superscript>2</Superscript>)-optimal supersaturated designs

Supersaturated designs are an important class of factorial designs in which the number of factors is larger than the number of runs. These designs supply an economical method to perform and analyze industrial experiments. In this paper, we consider generalized Legendre pairs and their corresponding matrices to construct E(s ²)-optimal two-level supersaturated designs suitable for screening experiments. Also, we provide some general theorems which supply several infinite families of E(s ²)-optimal two-level supersaturated designs of various sizes.      

E-optimal minimally connected block designs under mixed effects model

Summary Considering a mixed effects model in a minimally connected block design set-up, we obtain designs which areE-optimal, uniformly in the ratio of the variance components, for inference on varietal contrasts which constitute the fixed effects in the model. Work supported by the Centre for Management and Development Studies, Indian Institute of Management Calcutta. Work supported by the National Sciences and Engineering Research Council of Canada under grant number 7272 and partially done while visiting Indian Statistical Institute, Calcutta, India.     

Optimal mixed-level supersaturated design

A supersaturated design is essentially a fractional factorial in which the number of potential effects is greater than the number of runs. In this paper, E(f _NOD ) criterion is employed for comparing supersaturated designs from the viewpoint of orthogonality and uniformity, and a lower bound of E(f _NOD ) which can serve as a benchmark of design optimality is obtained. It is shown that the existing E(s ²) and ave ² criteria (for two- and three-level supersaturated designs respectively) are in fact special cases of this criterion. Furthermore, a construction method for mixed-level supersaturated designs is proposed and some properties of the resulting designs are investigated. Key words:Discrepancy; Hamming distance; Orthogonal array; Supersaturated design; Uniformity; U-type design. 2000 Mathematics Subject Classifications62K15, 62K05, 62K99. Corresponding author.     

Optimal extended complete block designs for dependent observations

Optimal designs under general dependence structures are usually difficult to specify theoretically or find algorithmically. However, they can sometimes be found for a specific dependence structure and a particular parameter value. In this paper, a class of generalized binary block designs with t treatments and b blocks of size k>t is considered. Each block consists of h consecutive complete blocks and, at the end, an incomplete block of size k−ht (if k > ht). For a suitable number of blocks, a universally optimal design is found for a first-order stationary autoregressive process with positive correlations. Optimal generalized binary designs and balanced block designs are also considered. Some constructions for a universally optimal design are described. A negative dependence parameter, and some other dependence structures, are also considered.     

A general construction of <Emphasis Type="Italic">E</Emphasis>(<Emphasis Type="Italic">s</Emphasis><Superscript>2</Superscript>)-optimal supersaturated designs via supplementary difference sets

Supplementary difference sets can be used to construct a variety of combinatorial designs. In this work, we construct supplementary difference sets that provide E(s ²)-optimal, two-level supersaturated designs with the equal occurrence property. Comparisons are made with previous works and it is shown that the proposed method gives promising results for the construction of supersaturated designs with good properties.     

Projection properties of certain three level orthogonal arrays

Two orthogonal arrays based on 3 symbols are said to be isomorphic or combinatorially equivalent if one can be obtained from the other by a sequence of row permutations, column permutations and permutations of symbols in each column. Orthogonal arrays are used as screening designs to identify active main effects, after which the properties of the subdesign for estimating these effects and possibly their interactions become important. Such a subdesign is known as a ``projection design'. In this paper we have identified all the inequivalent projection designs of an OA(27,13,3,2), an OA(18,7,3,2) and an OA(36,13,3,2) into k=3,4 and 5 factors. It is shown that the generalized wordlength pattern criterion proposed by Ma and Fang [23] can distinguish between most, but not all, inequivalent classes. We propose an extension of the Es² criterion (which is commonly used for measuring efficiency of 2-level designs) to distinguish further between the non-isomorphic classes and to measure the efficiency of the designs in these classes. Some concepts on generalized resolution are also discussed.     

A general construction of E(s 2)-optimal large supersaturated designs

A general method for construction of E(s ²)-optimal, two-level supersaturated designs (SSDs) with the equal occurrence property, from supplementary difference sets is introduced. It is proved that SSDs constructed in this way are E(s ²)-optimal. Comparisons are made with previous works and it is shown that the proposed method gives promising results for the construction of E(s ²)-optimal large SSDs.     

Comparison of test vs. control treatments using distance optimality criterion

We consider the problem of comparison of one test treatment (τ₀) with a set of v control treatments (τ₁, τ₂, …, τ_v) using distance optimality [DS-optimality] criterion introduced by Sinha (1970) in some treatment-connected design settings. It turns out that the nature of DS-optimal designs is quite similar to that for the usual A−, D− and E− optimality criteria. However, the optimality problem is quite complicated in most situations. First we deal with the CRD model and derive DS-optimal allocations for a given set of treatments. The results are almost identical to the A-optimal allocations for such problems. Then we consider a block design set-up and examine the nature of DS-optimal designs. In the process, we introduce the method of weighted coverage probability and maximize the resulting expression to obtain an optimal design. Received: December 1999     

A note on the determination of A-optimal type block designs under fixed and mixed effects models

In this paper, we consider the problem of estimating a selected set of contrasts between v treatments using a block design consisting of b blocks of size k. Traditionally, the construction of A-optimal block designs for such situations has been carried out assuming a fixed effects model. In this paper, we show that A-optimal designs constructed under a fixed effects model are robust in the sense that these designs have maximal minimal efficiency when considered among all available designs and under all possible mixed effects models. AMS 1991 subject classifications: Primary 62K05; Secondary 62K10     

TypeS designs with nested rows and columns

Summary Supplemented balance in block designs with nested rows and columns is considered, under the name of typeS designs with nested rows and columns. Analysis and construction of such designs are also discussed.     

On theE-optimality of certain asymmetrical designs under mixed effects model

TheE-optimality of the following designs within the class of all proper and connected designs with givenb, k andv under mixed effects model are established.

1. A group divisible design with λ₂ = λ₁ + 1.
2. A group divisible design with λ₁ = λ₂ + 1 and group size 2.
3. A linked block design.
4. The dual of design (i)
5. The dual of design (ii).

All these designs are known to satisfy the same optimality property under fixed effects model whenk<v, while the design (i) is known to beE-optimal even whenk>v. From the results proved here, theE-optimality of designs (ii, (iii), (iv) and (v) under fixed effects model in the situation whenk >v also follows.     

Robustness to the unavailability of data in block designs

We present general results for finding or boundingt _maxB , the maximum number of arbitrary whole blocks of observations which can be removed from a block design, and still leave all of the elementary treatment contrasts estimable. The block sizes may be larger than the number of treatments. The results are applied to BBDs, reinforced BIBDs and BBDs, BTIBDs, and a series of variance balanced incomplete block designs with two block sizes. Also given for most of these designs, are results fort _max, the maximum number of arbitrary, scattered observations that can become unavailable, and still leave all of the elementary treatment contrasts estimable.The work was undertaken while Dr. Whittinghill was visiting Ohio State University, and supported by a grant from the Natural Sciences Division, Colby College, Waterville, Maine.     

Construction of block designs admitting an Abelian automorphism group

Construction of block designs admitting an action of a presumed automorphism group consists of two basic steps: 1.construction of orbit structures for the given automorphism group, 2. construction of block designs for the orbit structures obtained in 1. For an abelian group G, the second step, called indexing, often lasts too long, because there are too many possibilities to be enumerated with today's computer facilities. To make such a construction possible we use a principal series of the group G to obtain a refinement of the orbit structures.     

Optimality and construction of some rectangular designs

We obtain a sufficient condition forE-optimality of equireplicate designs. As an application, we proveE-optimality of certain types of three-class PBIBDs based on rectangular association scheme — in short — rectangular designs. These designs turn out to be highly efficient with respect to theA-criterion as well. We also observe that these designs, though themeselves not regular graph designs (RGD's) are yet strictlyE-better than every competing RGD, wheneverv≥26 andv=2 (mod 4). This provides an infinite series of counter examples to the conjecture of John and Mitchell (1977). We also present two methods of construction of the rectangular designs. Apart from providing infinitely many examples of the designs provedE-optimal in this paper and in Cheng and Constantine (1986), this construction also provides — as a special case — the first known infinite series of most balanced group divisible designs, which were proved optimal with respect to all type 1 criteria by Cheng (1978).