Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.     

E-optimal incomplete block designs with two distinct block sizes

Sufficient conditions are derived for the determination of E-optimal designs in the class D(v,b₁,b₂,k₁,k₂) of incomplete block designs for v treatments in b₁ blocks of size k₁ each and b₂ blocks of size k₂ each. Some constructions for E-optimal designs that satisfy the sufficient conditions obtained here are given. In particular, it is shown that E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by augmenting b₂ blocks, with k₂ − k₁ extra plots each, of a BIBD(v,b = b₁ + b₂,k₁,λ) and GDD(v,b = b₁ + b₂,k₁,λ₁,λ₂). It is also shown that equireplicate E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by combining disjoint blocks of BIBD(v,b,k₁,λ) and GDD(v,b,k₁,λ₁,λ₂) into larger blocks. As applications of the construction techniques, several infinite series of E-optimal designs with small block sizes differing by at most two are given. Lower bounds for the A-efficiency are derived and it is found that A-efficiency exceeds 99% for v ⩾ 10, and at least 97.5% for 5 ⩽v < 10.     

Algorithmic and analytical construction of efficient designs in small blocks for comparing consecutive pairs of treatments

Optimal block designs in small blocks are explored under the A-, E- and D-criteria when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first formulate the problem via approximate theory which leads to a convenient multiplicative algorithm for obtaining A-optimal design measures. This, in turn, yields highly efficient exact designs, under the A-criterion, even when the number of blocks is rather small. Moreover, our approach is seen to allow nesting of such efficient exact designs which is an advantage when the resources for the experiment are available in possibly several stages. Illustrative examples are given and tables of A-optimal design measures are provided. Approximate theory is also seen to yield analytical results on E- and D-optimal design measures.     

E- and R-optimality of block designs for treatment-control comparisons

Abstract

We study optimal block designs for comparing a set of test treatments with a control treatment. We provide the class of all E-optimal approximate block designs, which is characterized by simple linear constraints. Based on this characterization, we obtain a class of E-optimal exact designs for unequal block sizes. In the studied model, we provide a statistical interpretation for wide classes of E-optimal designs. Moreover, we show that all approximate A-optimal designs and a large class of A-optimal exact designs for treatment-control comparisons are also R-optimal. This reinforces the observation that A-optimal designs perform well even for rectangular confidence regions.     

Approximate E-optimal designs for the model of spring balance weighing with a constant bias

The present paper analyzes the linear regression model with a nonzero intercept term on the vertices of a d-dimensional unit cube. This setting may be interpreted as a model of weighing d objects on a spring balance with a constant bias. We give analytic formulas for E-optimal designs, as well as their minimal efficiencies under the class of all orthogonally invariant optimality criteria, proving the criterion-robustness of the E-optimal designs. We also discuss the D- and A-optimal designs for this model.     

D-optimal block designs with at most six varieties

For given positive integers v, b, and k (all of them ≥2) a block design is a k × b array of the variety labels 1,…,v with blocks as columns. For the usual one-way heterogeneity model in standard form the problem is studied of finding a D-optimal block design for estimating the variety contrasts, when no balanced block design (BBD) exists. The paper presents solutions to this problem for v≤6. The results on D-optimality are derived from a graph-theoretic context. Block designs can be considered as multigraphs, and a block design is D-optimal iff its multigraph has greatest complexity (=number of spanning trees).     

MBMUDs: a combinatorial extension of BIBDs showing good optimality behaviour

The construction of a balanced incomplete block design (BIBD) is formulated in terms of combinatorial optimization by defining a cost function that reaches its lower bound on all and only those configurations corresponding to a BIBD. This cost function is a linear combination of distribution measures for each of the properties of a block design (number of plots, uniformity of rows, uniformity of columns, and balance). The approach generalizes naturally to a super-class BIBDs, which we call maximally balanced maximally uniform designs (MBMUDs), that allow two consecutive values for their design parameters [r,r+1;k,k+1;λ,λ+1]. In terms of combinatorial balance, MBMUDs are the closest possible approximation to BIBDs for all experimental settings where no set of admissible parameters exists. Thus, other design classes previously proposed with the same approximation aim—such as RDGs, SRDGs and NBIBDs of type I—can be viewed as particular cases of MBMUDs. Interestingly, experimental results show that the proposed combinatorial cost function has a monotonic relation with A- and D-statistical optimality in the space of designs with uniform rows and columns, while its computational cost is much lower.     

Optimum designs for estimating EDp based on raw optical density data

For raw optical density (ROD) data, such as those generated in biological assays employing an ELISA plate reader, ED_p-optimal designs are identified for a family of homogeneous non-linear models with two parameters. In every case, the theoretical ED_p-optimal design is a design with one or two support points. These theoretical optimal designs might not be suitable for many practical applications. To overcome this shortcoming, we have specified ED_p-optimal designs within the class of k-point equally spaced and uniform designs. The efficiency robustness of these designs with respect to initial nominal values of the parameters have been investigated.     

Construction of (M,S)-optimal design for block size 3

(M,S)-optimal designs are constructed for block size three when the number of treatments is of the form 6t + 3.     

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\).     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

Optimal designs for discriminating between some extensions of the Michaelis–Menten model

In this paper some results on the computation of optimal designs for discriminating between nonlinear models are provided. In particular, some typical deviations of the Michaelis–Menten model are considered. A common deviation of this pharmacokinetic model consists on adding a linear term. If two linear models differ in one parameter the T-optimal design for discriminating between them is c-optimal for estimating the added linear term. This is not the case for nonlinear models.     

Rank-order choice-based conjoint experiments: Efficiency and design

In a rank-order choice-based conjoint experiment, the respondent is asked to rank a number of alternatives of a number of choice sets. In this paper, we study the efficiency of those experiments and propose a D-optimality criterion for rank-order experiments to find designs yielding the most precise parameter estimators. For that purpose, an expression of the Fisher information matrix for the rank-ordered conditional logit model is derived which clearly shows how much additional information is provided by each extra ranking step. A simulation study shows that, besides the Bayesian D-optimal ranking design, the Bayesian D-optimal choice design is also an appropriate design for this type of experiments. Finally, it is shown that considerable improvements in estimation and prediction accuracy are obtained by including extra ranking steps in an experiment.     

On D-optimal robust second order slope-rotatable designs

Das and Park (2006) introduced slope-rotatable designs overall directions for correlated observations which is known as A-optimal robust slope-rotatable designs. This article focuses D-optimal slope-rotatable designs for second-order response surface model with correlated observations. It has been established that robust second-order rotatable designs are also D-optimal robust slope-rotatable designs. A class of D-optimal robust second-order slope-rotatable designs has been derived for special correlation structures of errors.     

The construction of optimal designs for dose-escalation studies

Methods for the construction of A-, MV-, D- and E-optimal designs for dose-escalation studies are presented. Algebraic results proved elusive and explicit expressions for the requisite optimal designs are only given for a restricted class of traditional designs. Recourse to numerical procedures and heuristics is therefore made. Complete enumeration of all possible designs is discussed but is, as expected, highly computer intensive. Two exchange algorithms, one based on block exchanges and termed the Block Exchange Algorithm and the other a candidate-set-free algorithm based on individual exchanges and termed the Best Move Algorithm, are therefore introduced. Of these the latter is the most computationally effective. The methodology is illustrated by means of a range of carefully selected examples.     

D- and V-optimal population designs for the quadratic regression model with a random intercept term

In this paper D- and V-optimal population designs for the quadratic regression model with a random intercept term and with values of the explanatory variable taken from a set of equally spaced, non-repeated time points are considered. D-optimal population designs based on single-point individual designs were readily found but the derivation of explicit expressions for designs based on two-point individual designs was not straightforward and was complicated by the fact that the designs now depend on ratio of the variance components. Further algebraic results pertaining to d-point D-optimal population designs where d≥3 and to V-optimal population designs proved elusive. The requisite designs can be calculated by careful programming and this is illustrated by means of a simple example.     

Optimal selection and ordering of columns in supersaturated designs

Two methods to select columns for assigning factors to work on supersaturated designs are proposed. The focus of interest is the degree of non-orthogonality between the selected columns. One method is the exhaustive enumeration of selections of p columns from all k columns to find the exact optimality, while the other is intended to find an approximate solution by applying techniques used in the corresponding analysis, aiming for ease of use as well as a reduction in the large computing time required for large k with the first method. Numerical illustrations for several typical design matrices reveal that the resulting “approximately” optimal assignments of factors to their columns are exactly optimal for any p. Ordering the columns in E(s²)-optimal designs results in promising new findings including a large number of E(s²)-optimal designs.     

An algorithm for calculating D-optimal designs for polynomial regression through a fixed point

Optimal designs are required to make efficient statistical experiments. By using canonical moments, in 1980, Studden found D_s-optimal designs for polynomial regression models. On the other hand, integrable systems are dynamical systems whose solutions can be written down concretely. In this paper, polynomial regression models through a fixed point are discussed. In order to calculate D-optimal designs for these models, a useful relationship between canonical moments and discrete integrable systems is introduced. By using canonical moments and discrete integrable systems, a new algorithm for calculating D-optimal designs for these models is proposed.     

Optimal mixed-level k-circulant supersaturated designs

Supersaturated designs (SSDs) offer a potentially useful way to investigate many factors with only few experiments in the preliminary stages of experimentation. This paper explores how to construct E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs using k-cyclic generators. The necessary and sufficient conditions for the existence of mixed-level k-circulant SSDs with the equal occurrence property are provided. Properties of the mixed-level k  -circulant SSDs are investigated, in particular, the sufficient condition under which the generator vector produces an E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal SSD is obtained. Moreover, many new E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs are constructed and listed. The method here generalizes the one proposed by Liu and Dean [2004. k$k$-circulant supersaturated designs. Technometrics 46, 32–43] for two-level SSDs and the one due to Georgiou and Koukouvinos [2006. Multi-level k-circulant supersaturated designs. Metrika 64, 209–220] for the multi-level case.