Recently, balanced incomplete Latin square designs are introduced in the literature. We propose three methods of constructions of balanced incomplete Latin square designs. Particular classes of Latin squares namely Knut Vik designs, semi Knut Vik designs, and crisscross Latin squares play a key role in the construction.
7 April 2015 in Communications in Statistics - Theory and Methods
This article proposes a new linear integer programming approach to obtain cyclic circular balanced and strongly balanced crossover designs for a given number of treatments v, number of periods p, and number of units n. The linear integer programming approach has been used for generating a sequence of treatments to be assigned to the units. Using this approach, cyclic circular balanced and strongly balanced crossover designs for v < 30, p < 5, and λ ⩽ 4 or λ* ⩽ 4 have been generated, where λ (λ*) refers to the number of times each treatment is preceded by every other treatment excluding itself (including itself) depending on whether it is circular balanced or circular strongly balanced. The designs obtained are uniform over periods. A catalogue of designs for v < 30, p < 5, λ ⩽ 4 or λ* ⩽ 4, p < v with n ⩽ 100 is given. The designs obtained are universally optimal over the class of all connected designs with a fixed number of treatments, number of periods, and number of sequences.
2 June 2020 in Communications in Statistics - Simulation and Computation
The purpose of this article is to present an algorithm to construct A-optimal balanced treatment incomplete block (BTIB) designs. A number of A-optimal BTIB designs are constructed in the parametric range2 <= v <= 30,v <= b <= 50,2 <= k <= min(10,v).The proposed algorithm is implemented using R language.
8 November 2017 in Communications in Statistics - Theory and Methods
(2018). Incomplete row-column designs with factorial treatment structure for estimating main effects with full efficiency. Communications in Statistics - Theory and Methods: Vol. 47, No. 18, pp. 4493-4502.
8 June 2017 in Communications in Statistics - Simulation and Computation
In Balanced Sampling Plans Excluding Adjacent Units (BSA plans) first order inclusion probabilities are equal and second order inclusion probabilities are zero for pairs of units at a distance less than or equal to m and are constant for pairs of units which are at a distance greater than m. These plans are useful when the adjacent units in the population provide similar information. In this paper, an algorithm based on linear programming approach has been developed for construction of two-dimensional BSA plans under sharing a border and island adjacency schemes for m ≤ 2. Some results on existence of such BSA plans have also been obtained for each adjacency scheme separately.