kvec

NNPo

incidence matrix upto previous rows

whether concurrence constraints are to be relaxed? value 1 for yes, 0 for no.
 Default is 0.

relaxed

All decision variables are binary to get a binary block. Default is TRUE.

binary

This function update an incidence matrix by adding a row through linear integer 
programming formulation for given number of treatments, number of blocks, block sizes and 
concurrence matrix and the previous rows of incidence matrix

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

LIP function

<dl>	<dt>v</dt>
<dd>number of treatments</dd>	<dt>b</dt>
<dd>number of blocks</dd>	<dt>kvec</dt>
<dd>block sizes</dd>	<dt>NNPo</dt>
<dd>specified concurrence matrix</dd>	<dt>N1</dt>
<dd>incidence matrix upto previous rows</dd>	<dt>T</dt>
<dd>tabu list of deleted rows</dd>	<dt>relaxed</dt>
<dd>whether concurrence constraints are to be relaxed? value 1 for yes, 0 for no.
 Default is 0.</dd>	<dt>binary</dt>
<dd>All decision variables are binary to get a binary block. Default is TRUE.</dd>	</dl>

Arguments

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

Author

Linear integer programming formulation to update incidence matrix — LIP

<dl>

	<dt>v</dt>
<dd>number of treatments</dd>

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

	<dt>kvec</dt>
<dd>block sizes</dd>

	<dt>NNPo</dt>
<dd>specified concurrence matrix</dd>

	<dt>N1</dt>
<dd>incidence matrix upto previous rows</dd>

	<dt>T</dt>
<dd>tabu list of deleted rows</dd>

	<dt>relaxed</dt>
<dd>whether concurrence constraints are to be relaxed? value 1 for yes, 0 for no.
 Default is 0.</dd>

	<dt>binary</dt>
<dd>All decision variables are binary to get a binary block. Default is TRUE.</dd>

	</dl>

LIP: Linear integer programming formulation to update incidence matrix

Description

Usage

Value

Arguments

Author