Construction of Lattice Square Designs
โ Scribed by Prof. W. T. Federer; J. Wright
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 368 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
โฆ Synopsis
KHARE and FEDERER
(1981)
presented a simple method for constructing incomplete block designs for any number of treatments. Their procedure is extended to constructing lattice square designs. Using variety cutting, lattice square designs are available for any number of treatments.
๐ SIMILAR VOLUMES
Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number
A method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs. ## 1 . Introduction For a BIB design with parameters v, b, r , k, I if the blocks can be separated into t
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 an