An affine ฮฑ-resolvable PBD of index ฮป is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in ฮป blocks, (ii) any point occurs in ฮฑ blocks of each
Construction of Resolvable Designs with Nested Treatment Structure
โ Scribed by E.R. Williams; J.A. John
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 132 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
โฆ Synopsis
The construction of resolvable incomplete block and row-column designs is investigated when the treatments have a nested structure. Some theoretical results are derived for lattice designs. Efficient designs for unequal-sized treatment groups are obtained by defining a multiple objective function and carrying out a computer search using an interchange algorithm.
๐ SIMILAR VOLUMES
A number of methods of construction of partially balanced inconiplete block designs with nested rows and columns are developed and new balanced incomp1et.e block designs with nested rows and columns are obtained as a by-product.
An a-resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly times. In this paper, we show that the necessary conditions for the existence of -resolvable designs with block size four are sufยฎ
A model and methode are preaentd for the analyeis of a nested design with binomially-dietributed outoome variables. The propwed method may ale0 be applicable t o the analyeie of singly-ordered amtingenoy tables.
We consider direct constructions due to R. J. R. Abel and