Record Details

Efficient incomplete block designs through linear integer programming

KRISHI: Publication and Data Inventory Repository

View Archive Info
 
 
Field Value
 
Title Efficient incomplete block designs through linear integer programming
Not Available
 
Creator B.N. Mandal
V.K. Gupta
Rajender Parsad
 
Subject Incomplete block design
Linear integer programming
A-efficiency
D-efficiency
Algorithm
 
Description Not Available
The purpose of this paper is to present a linear integer programming approach to construct efficient binary incomplete block designs for any given number of treatments v, number of blocks b, with common block-size k, and with a nearly balanced concurrence matrix. The proposed approach is illustrated by constructing an efficient incomplete block design. A-efficient and D-efficient incomplete block designs have been constructed and catalogued using the proposed algorithm for a restricted range of parameters 3 ⩽ v ⩽ 20, b ⩾ v, and 2 ⩽ k ⩽ min(10, v − 1), with vb⩽1, 000. An R package is developed to implement the proposed approach.
Not Available
 
Date 2017-09-05T04:43:15Z
2017-09-05T04:43:15Z
2014-06
 
Type Research Paper
 
Identifier Mandal, B.N., Gupta, V.K. and Parsad, Rajender (2014). Efficient incomplete block designs through linear integer programming. American Journal of Mathematical and Management Sciences, 33(2), 110-124
Not Available
http://krishi.icar.gov.in/jspui/handle/123456789/5256
 
Language English
 
Relation Not Available;
 
Publisher Taylor & Francis Online