interchange.NNP

This function interchanges the distinct off-diagonal elements of a given concurrence
 matrix and produces a concurrence matrix which has highest A-efficiency

internal

A collection of several utility functions related to binary incomplete block designs. The package contains function to generate A- and D-efficient binary incomplete block designs with given numbers of treatments, number of blocks and block size. The package also contains function to generate an incomplete block design with specified concurrence matrix. There are functions to generate balanced treatment incomplete block designs and incomplete block designs for test versus control treatments comparisons with specified concurrence matrix. Package also allows performing analysis of variance of data and computing estimated marginal means of factors from experiments using a connected incomplete block design. Tests of hypothesis of treatment contrasts in incomplete block design set up is supported.

B N Mandal

Incomplete Block Designs

interchange.NNP function

<dl>	<dt>b</dt>
<dd>number of blocks</dd>	<dt>k</dt>
<dd>block size</dd>	<dt>NNP</dt>
<dd>concurrence matrix</dd>	</dl>

Arguments

B N Mandal &lt;mandal.stat@gmail.com&gt;

Author

Interchange the elements of a concurrence matrix to get highest possible lower bound to A-efficiency — interchange.NNP

<dl>

	<dt>b</dt>
<dd>number of blocks</dd>

	<dt>k</dt>
<dd>block size</dd>

	<dt>NNP</dt>
<dd>concurrence matrix</dd>

	</dl>

interchange.NNP: Interchange the elements of a concurrence matrix to get highest possible lower bound to A-efficiency

Description

Usage

Value

Arguments

Author