Record Details

Linear integer programming approach to construct distance balanced sampling plans

KRISHI: Publication and Data Inventory Repository

View Archive Info
 
 
Field Value
 
Title Linear integer programming approach to construct distance balanced sampling plans
Not Available
 
Creator B.N. Mandal
Rajender Parsad
V.K. Gupta
 
Subject Balanced sampling plans
Distance balanced sampling plans
Distance balanced incomplete block designs
Linear integer programming
 
Description Not Available
Distance balanced sampling plans (DBSP) area a class of sampling plans in which second order inclusion probabilities are non-decreasing function of the distance between the population units. DBSP were introduced by Mandal et al. (2009) as a generalization of balanced sampling plans excluding adjacent units. In this article, a general w-point DBSP w = 1, 2, ..., [N/2], were N is the population size and [x] denotes largest integer contained in x is introduced and a method of construction of w-point DBSP using linear integer programming is proposed. The method is general in nature and two-point, three-point, [N/2]-point, many other DBSPs, simple random sampling without replacement, balanced sampling plans excluding contiguous units (Hedayat et al., 1988) and balanced sampling without excluding adjacent units (Stufken, 1993) fall out as a particular case. A list of [N/2]-point DBSP for sample size three is obtained for population size N 100, where N is odd.
Not Available
 
Date 2017-07-20T11:59:15Z
2017-07-20T11:59:15Z
2010-08
 
Type Research Paper
 
Identifier Mandal, B.N., Parsad, Rajender and Gupta, V.K. (2010). Linear integer programming approach to construct distance balanced sampling plans. Journal of Indian Society of Agricultural Statistics, 64(2), 303-312.
Not Available
http://krishi.icar.gov.in/jspui/handle/123456789/4876
 
Language English
 
Relation Not Available;
 
Publisher Indian Society of Agricultural Statistics