An Optimal Multivariate Stratified Sampling Design Using Dynamic Programming

Numerous optimization problems arise in survey designs. The problem of obtaining an optimal (or near optimal) sampling design can be formulated and solved as a mathematical programming problem. In multivariate stratified sample surveys usually it is not possible to use the individual optimum allocations for sample sizes to various strata for one reason or another. In such situations some criterion is needed to work out an allocation which is optimum for all characteristics in some sense. Such an allocation may be called an optimum compromise allocation. This paper examines the problem of determining an optimum compromise allocation in multivariate stratified random sampling, when the population means of several characteristics are to be estimated. Formulating the problem of allocation as an all integer nonlinear programming problem, the paper develops a solution procedure using a dynamic programming technique. The compromise allocation discussed is optimal in the sense that it minimizes a weighted sum of the sampling variances of the estimates of the population means of various characteristics under study. A numerical example illustrates the solution procedure and shows how it compares with Cochran's average allocation and proportional allocation.     

Fuzzy multi-objective optimization for optimum allocation in multivariate stratified sampling with quadratic cost and parabolic fuzzy numbers

This article deals with the uncertainties in a multivariate stratified sampling problem. The uncertain parameters of the problem, such as stratum standard deviations, measurement costs, travel costs and total budget of the survey, are considered as parabolic fuzzy numbers and the problem is formulated as a fuzzy multi-objective nonlinear programming problem with quadratic cost function. Using α-cut, parabolic fuzzy numbers are defuzzified and then the compromise allocations of the problem are obtained by fuzzy programming for a prescribed value of α. To demonstrate the utility of the proposed problem a numerical example is solved with the help of [LINGO User?s Guid. Lindo Systems Inc., 1415 North Dayton Street, Chicago,Illinois-60622, (USA), 2013] software and the derived compromise optimum allocation is compared with deterministic and proportional allocations.     

Compromise allocation in multivariate stratified surveys with stochastic quadratic cost function

In many real life situations the linear cost function does not approximate the actual cost incurred adequately. The cost of traveling between the units selected in the sample within a stratum is significant, instead of linear cost function. In this paper, we have considered the problem of finding a compromise allocation for a multivariate stratified sample survey with a significant travel cost within strata is formulated as a problem of non-linear stochastic programming with multiple objective functions. The compromise solutions are obtained through Chebyshev approximation technique, D ₁- distance and goal programming. A numerical example is presented to illustrate the computational details of the proposed methods.     

Multi-objective nonlinear programming problem approach in multivariate stratified sample surveys in the case of non-response

In multivariate cases, usually the minimization of sampling variances is considered as an objective under a cost constraint. Since the variances are not unit free, it is more logical to consider the minimization of the squared coefficients of variation as an objective. In this paper, the problem of optimum compromise allocation in multivariate stratified sampling in the case of non-response as a multi-objective all-integer nonlinear programming problem is described. A solution procedure using four different approaches is considered, namely the value function, goal programming,∈-constraint and distance based, to obtain the compromise allocation for non-response. A numerical example is also presented to illustrate the computational details.     

Optimum multivariate stratified double sampling design: Chebyshev's Goal Programming approach

In stratified sampling when strata weights are unknown a double sampling technique may be used to estimate them. A large simple random sample from the unstratified population is drawn and units falling in each stratum are recorded. A stratified random sample is then selected and simple random subsamples are obtained out of the previously selected units of the strata. This procedure is called double sampling for stratification. If the problem of non-response is there, then subsamples are divided into classes of respondents and non-respondents. A second subsample is then obtained out of the non-respondents and an attempt is made to obtain the information by increasing efforts, persuasion and call backs. In this paper, the problem of obtaining a compromise allocation in multivariate stratified random sampling is discussed when strata weights are unknown and non-response is present. The problem turns out to be a multiobjective non-linear integer programming problem. An approximation of the problem to an integer linear programming problem by linearizing the non-linear objective functions at their individual optima is worked out. Chebyshev's goal programming technique is then used to solve the approximated problem. A numerical example is also presented to exhibit the practical application of the developed procedure.     

Estimation of finite population kurtosis under two-phase sampling for nonresponse

In this paper an estimator of finite population kurtosis computed under the two-phase sampling for nonresponse is proposed. The formulas characterizing its asymptotic properties are derived using Taylor linearization technique for the general situation of arbitrary sampling designs in both phases and stochastic nonresponse represented by arbitrary response distribution. An important special case of simple random sampling without replacement and deterministic nonresponse is also considered.     

Doubly robust point and variance estimation in the presence of imputed survey data

Imputation is often used in surveys to treat item nonresponse. It is well known that treating the imputed values as observed values may lead to substantial underestimation of the variance of the point estimators. To overcome the problem, a number of variance estimation methods have been proposed in the literature, including resampling methods such as the jackknife and the bootstrap. In this paper, we consider the problem of doubly robust inference in the presence of imputed survey data. In the doubly robust literature, point estimation has been the main focus. In this paper, using the reverse framework for variance estimation, we derive doubly robust linearization variance estimators in the case of deterministic and random regression imputation within imputation classes. Also, we study the properties of several jackknife variance estimators under both negligible and nonnegligible sampling fractions. A limited simulation study investigates the performance of various variance estimators in terms of relative bias and relative stability. Finally, the asymptotic normality of imputed estimators is established for stratified multistage designs under both deterministic and random regression imputation. The Canadian Journal of Statistics 40: 259–281; 2012 © 2012 Statistical Society of Canada     

On the Problem of Compromise Allocation in Multi-Response Stratified Sample Surveys

In stratified sample surveys, the problem of determining the optimum allocation is well known due to articles published in 1923 by Tschuprow and in 1934 by Neyman. The articles suggest the optimum sample sizes to be selected from each stratum for which sampling variance of the estimator is minimum for fixed total cost of the survey or the cost is minimum for a fixed precision of the estimator. If in a sample survey more than one characteristic is to be measured on each selected unit of the sample, that is, the survey is a multi-response survey, then the problem of determining the optimum sample sizes to various strata becomes more complex because of the non-availability of a single optimality criterion that suits all the characteristics. Many authors discussed compromise criterion that provides a compromise allocation, which is optimum for all characteristics, at least in some sense. Almost all of these authors worked out the compromise allocation by minimizing some function of the sampling variances of the estimators under a single cost constraint. A serious objection to this approach is that the variances are not unit free so that minimizing any function of variances may not be an appropriate objective to obtain a compromise allocation. This fact suggests the use of coefficient of variations instead of variances. In the present article, the problem of compromise allocation is formulated as a multi-objective non-linear programming problem. By linearizing the non-linear objective functions at their individual optima, the problem is approximated to an integer linear programming problem. Goal programming technique is then used to obtain a solution to the approximated problem.     

Optimum allocation in multivariate stratified sampling design in the presence of nonresponse with Gamma cost function

In multivariate stratified sample survey with L strata, let p-characteristics are defined on each unit of the population. To estimate the unknown p-population means of each characteristic, a random sample is taken out from the population. In multivariate stratified sample survey, the optimum allocation of any characteristic may not be optimum for others. Thus the problem arises to find out an allocation which may be optimum for all characteristics in some sense. Therefore a compromise criterion is needed to workout such allocation. In this paper, the procedure of estimation of p-population means is discussed in the presence of nonresponse when the use of linear cost function is not advisable. A solution procedure is suggested by using lexicographic goal programming problem. The numerical illustrations are given for its practical utility.     

Optimal allocation of stratified samples with several variance constraints and equal workloads over time by geometric programming

We apply geometric programming, developed by Duffin, Peterson and Zener (1967), to the optimal allocation of stratified samples with several variance constraints arising from several estimates of deficiency rates in the quality control of administrative decisions. We develop also a method for imposing constraints on sample sizes to equalize workloads over time, as required by the practicalities of clerical work for quality control.

We allocate samples by an extension of the work of Neyman (1934), following the exposition of Cochran (1977). Davis and Schwartz (1987) developed methods for multiconstraint Neyman allocation by geometric programming for integrated sampling. They also applied geometric programming to Neyman allocation of a sample for estimating college enrollments by Cornell (1947) and Cochran (1977). This paper continues the application of geometric programming to Neyman allocation with multiple constraints on variances and workloads and minimpal sampling costs.     

Stratified Double Sampling with Continuous Outcomes: Design and Analysis

We provide a method for estimating the sample mean of a continuous outcome in a stratified population using a double sampling scheme. The stratified sample mean is a weighted average of stratum specific means. It is assumed that the fallible and true outcome data are related by a simple linear regression model in each stratum. The optimal stratified double sampling plan, i.e. , the double sampling plan that minimizes the cost of sampling for fixed variances, or alternatively, minimizes the variance for fixed costs, is found and compared to a standard sampling plan. The design parameters are the total sample size and the number of doubly sampled units in each stratum. We show that the optimal double sampling plan is a function of the between-strata and within-strata cost and variance ratios. The efficiency gains, relative to standard sampling plans, under broad set of conditions, are considerable.     

A new mixed chain sampling plan based on the process capability index for product acceptance

This article proposes a new mixed chain sampling plan based on the process capability index C_pk, where the quality characteristic of interest follows the normal distribution with unknown mean and variance. The advantages of this proposed mixed sampling plan are also discussed. Tables are constructed to determine the optimal parameters for practical applications. In order to construct the tables, the problem is formulated as a nonlinear programming where the objective function to be minimized is the average sample number and the constraints are related to lot acceptance probabilities at acceptable quality level and limiting quality level under the operating characteristic curve. The practical application of the proposed mixed sampling plan is explained with an illustrative example. Comparison of the proposed sampling plan is also made with other existing sampling plans.     

Estimation of a rare sensitive attribute in a stratified sample using Poisson distribution

This study proposes the estimators for the mean and its variance of the number of respondents who possessed a rare sensitive attribute based on stratified sampling schemes (stratified sampling and stratified double sampling). This study deals with the extension of the estimation reported in Land et al. [Estimation of a rare sensitive attribute using Poisson distribution, Statistics (2011), in press. DOI: 10.1080/02331888.2010.524300] using a Poisson distribution and an unrelated question randomized response model reported in Greenberg et al. [The unrelated question randomized response model: Theoretical framework, J. Amer. Statist. Assoc. 64 (1969), 520–539]. In the stratified sampling, the estimators are proposed when the parameter of the rare unrelated attribute is known and unknown. The variances of estimators using a proportional and optimum allocation are also suggested. The proposed estimators are evaluated using a relative efficiency comparing variances of the estimators reported in Land et al. depending on the parameters and the probability of selecting a question. We showed that our proposed methods have better efficiencies than Land et al.’s randomized response model in some conditions. When the sizes of stratified populations are not given, other estimators are suggested using a stratified double sampling. For the proportional allocation, the difference between two variances in the stratified sampling and the stratified double sampling is given with the known rare unrelated attribute.     

Multi-objective optimization for optimum allocation in multivariate stratified sampling with quadratic cost

In stratified sampling, usually the cost function is taken as a linear function of sample sizes n _h . In many practical situations, the linear cost function does not approximate the actual cost incurred adequately. For example, when the cost of travelling between the units selected in the sample within a stratum is significant, instead of a linear cost function, a cost function that is quadratic in √n _h will be a more close approximation to the actual cost. In this paper, the problem is formulated as multi-objective nonlinear integer programming problem with quadratic cost under three different situations, i.e. complete, partial or null information about the population. A numerical example is also presented to illustrate the computational details.     

Geometric programming for optimal allocation of integrated samples in quality control

We apply geometric programming, developed by Duffin, Peterson Zener (1967), to the optimal allocation of stratified samples. As an introduction, we show how geometric programming is used to allocate samples according to Neyman (1934), using the data of Cornell (1947) and following the exposition of Cochran (1953).

Then we use geometric programming to allocate an integrated sample introduced by Schwartz (1978) for more efficient sampling of three U. S. Federal welfare quality control systems, Aid to Families with Dependent Children, Food Stamps and Medicaid.

We develop methods for setting up the allocation problem, interpreting it as a geometric programming primal problem, transforming it to the corresponding dual problem, solving that, and finding the sample sizes required in the allocation problem. We show that the integrated sample saves sampling costs.     

Probability and statisitics in the service of computer science: illustrations using the assignment problem

Recent work on the assignment problem is surveyed with the aim of illustrating the contribution that stochastic thinking can make to problems of interest to computer scientists. The assignment problem is thus examined in connection with the analysis of greedy algorithms, marriage lemmas, linear programming with random costs, randomization based matching, stochastic programming, and statistical mechanics. (The survey is based on the invited presentation given during the “Statistics Days at FSU” in March 1990.)     

Optimal stratification in stratified designs using weibull-distributed auxiliary information

Sampling has evolved into a universally accepted approach for gathering information and data mining as it is widely accepted that a reasonably modest-sized sample can sufficiently characterize a much larger population. In stratified sampling designs, the whole population is divided into homogeneous strata in order to achieve higher precision in the estimation. This paper proposes an efficient method of constructing optimum stratum boundaries (OSB) and determining optimum sample size (OSS) for the survey variable. The survey variable may not be available in practice since the variable of interest is unavailable prior to conducting the survey. Thus, the method is based on the auxiliary variable which is usually readily available from past surveys. To illustrate the application as an example using a real data, the auxiliary variable considered for this problem follows Weibull distribution. The stratification problem is formulated as a Mathematical Programming Problem (MPP) that seeks minimization of the variance of the estimated population parameter under Neyman allocation. The solution procedure employs the dynamic programming technique, which results in substantial gains in the precision of the estimates of the population characteristics.     

Harmonic mean approach to uunbalanced random effects models under heteroscedasticity

In this paper we consider unbalanced random effects models under heteroscedastic variances. By using' the harmonic mean approach, it is shown that the problems are analogous to those from balanced random effects models under horaoscedastic variances. Thus, by using the harmonic mean approach, statistical inferences about variance components are derived by using procedures from balanced models under homoscedastic variances. Laguerre polynomial expansion is used to approximate the sampling distributions of relevant statistics.     

Some calibration estimators for finite population mean in two-stage stratified random sampling

Abstract

In the present article, an effort has been made to develop calibration estimators of the population mean under two-stage stratified random sampling design when auxiliary information is available at primary stage unit (psu) level. The properties of the developed estimators are derived in-terms of design based approximate variance and approximate consistent design based estimator of the variance. Some simulation studies have been conducted to investigate the relative performance of calibration estimator over the usual estimator of the population mean without using auxiliary information in two-stage stratified random sampling. Proposed calibration estimators have outperformed the usual estimator without using auxiliary information.     

Trade-off between cost and variance for a multi-objective compromise allocation in stratified random sampling

In the present paper, a multi-objective goal optimization mechanism is developed by trading off between cost and variance. Both are adversaries to each other while allocating a sample size even in stratified sampling design. Discussion section shows how these adversaries put their influence on optimal selection. This is a dual optimization procedure in which variance or mean square error is optimized in the first step and then considering some compromise on variance, cost is optimized. The process is applied to both individual and multi-objective programming models.