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.     

Estimation of Population Means in Multivariate Stratified Random Sampling

In multivariate surveys where p (> 1) characteristics are defined on each unit of the population, the problem of allocation becomes complicated. In the present article, we propose a method to work out the compromise allocation in a multivariate stratified surveys. The problem is formulated as a Multiobjective Integer Nonlinear Programming Problem. Using the value function technique, the problem is converted into a single objective problem. A formula for continuous sample sizes is obtained using Lagrange Multipliers Technique (LMT) that can provide a near optimum solution in some cases. It may give an initial point for any integer nonlinear programing technique.     

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.     

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.     

A NOTE ON OPTIMUM STRATIFICATION FOR EQUAL ALLOCATION WITH RATIO AND REGRESSION METHODS OF ESTIMATION

When the information on a highly positively correlated auxiliary variable x is used to construct stratified regression (or ratio) estimates of the population mean of the study variable y, the paper considers the problem of determining approximately optimum strata boundaries (AOSB) on x when the sample size in each stratum is equal. The form of the conditional variance function V(y/x) is assumed to be known. A numerical investigation into the relative efficiency of equal allocation with respect to the Neyman and proportional allocations has also been made. The relative efficiency of equal allocation with respect to Neyman allocation is found to be nearly equal to one.     

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.     

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.     

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.     

The Equivalence of Neyman Optimum Allocation for Sampling and Equal Proportions for Apportioning the U.S. House of Representatives

We present a surprising though obvious result that seems to have been unnoticed until now. In particular, we demonstrate the equivalence of two well-known problems—the optimal allocation of the fixed overall sample size n among L strata under stratified random sampling and the optimal allocation of the H = 435 seats among the 50 states for apportionment of the U.S. House of Representatives following each decennial census. In spite of the strong similarity manifest in the statements of the two problems, they have not been linked and they have well-known but different solutions; one solution is not explicitly exact (Neyman allocation), and the other (equal proportions) is exact. We give explicit exact solutions for both and note that the solutions are equivalent. In fact, we conclude by showing that both problems are special cases of a general problem. The result is significant for stratified random sampling in that it explicitly shows how to minimize sampling error when estimating a total T_Y while keeping the final overall sample size fixed at n; this is usually not the case in practice with Neyman allocation where the resulting final overall sample size might be near n + L after rounding. An example reveals that controlled rounding with Neyman allocation does not always lead to the optimum allocation, that is, an allocation that minimizes variance.     

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.     

Multiobjective Stochastic Multivariate Stratified Sampling in Presence of Nonresponse

The case of nonresponse in multivariate stratified sampling survey was first introduced by Hansen and Hurwitz in 1946 considering the sampling variances and costs to be deterministic. However, in real life situations sampling variance and cost are often random (stochastic) and have probability distributions. In this article, we have formulated the multivariate stratified sampling in the presence of nonresponse with random sampling variances and costs as a multiobjective stochastic programming problem. Here, the sampling variance and costs are considered random and converted into a deterministic NLPP by using chance constraint and modified E-model. A solution procedure using three different approaches are adopted viz. goal programming, fuzzy programming, and D₁ distance method to obtain the compromise allocation for the formulated problem. An empirical study has also been provided to illustrate the computational details.     

Sample size determination for estimating multivariate process capability indices based on lower confidence limits

With the advent of modern technology, manufacturing processes have become very sophisticated; a single quality characteristic can no longer reflect a product's quality. In order to establish performance measures for evaluating the capability of a multivariate manufacturing process, several new multivariate capability (NMC) indices, such as NMC _p and NMC _pm , have been developed over the past few years. However, the sample size determination for multivariate process capability indices has not been thoroughly considered in previous studies. Generally, the larger the sample size, the more accurate an estimation will be. However, too large a sample size may result in excessive costs. Hence, the trade-off between sample size and precision in estimation is a critical issue. In this paper, the lower confidence limits of NMC _p and NMC _pm indices are used to determine the appropriate sample size. Moreover, a procedure for conducting the multivariate process capability study is provided. Finally, two numerical examples are given to demonstrate that the proper determination of sample size for multivariate process indices can achieve a good balance between sampling costs and estimation precision.     

Simultaneous confidence intervals on partial means of classes in the two-stage stratified sampling

Let’s consider a finite population of P units, each of them assumes a specific amount of the quantitative variable X. Moreover we assume that the range of values of X is subdivided into k classes and the sampling data come out from a two stage stratified sampling. The main purpose of the work is to determine the estimators, as well as their asymptotic distribution, of the partial means of classes, each of them is defined as a non linear function of the other parameters. Particularly, we are interested in determining the linear approximation estimators and, under convergence theorems, the asymptotic distribution. Afterwards we define the estimator of the vector of the partial means of classes and its asymptotic convergence to multivariate normal distribution is determined. These results are useful to develop simultaneous inferential procedures.     

Inferences on the Coefficients of Variation in a Multivariate Normal Population

In this article, the problem of testing the equality of coefficients of variation in a multivariate normal population is considered, and an asymptotic approach and a generalized p-value approach based on the concepts of generalized test variable are proposed. Monte Carlo simulation studies show that the proposed generalized p-value test has good empirical sizes, and it is better than the asymptotic approach. In addition, the problem of hypothesis testing and confidence interval for the common coefficient variation of a multivariate normal population are considered, and a generalized p-value and a generalized confidence interval are proposed. Using Monte Carlo simulation, we find that the coverage probabilities and expected lengths of this generalized confidence interval are satisfactory, and the empirical sizes of the generalized p-value are close to nominal level. We illustrate our approaches using a real data.     

An eigenproblem approach to optimal equal-precision sample allocation in subpopulations

Allocation of samples in stratified and/or multistage sampling is one of the central issues of sampling theory. In a survey of a population often the constraints for precision of estimators of subpopulations parameters have to be taken care of during the allocation of the sample. Such issues are often solved with mathematical programming procedures. In many situations it is desirable to allocate the sample, in a way which forces the precision of estimates at the subpopulations level to be both: optimal and identical, while the constraints of the total (expected) size of the sample (or samples, in two-stage sampling) are imposed. Here our main concern is related to two-stage sampling schemes. We show that such problem in a wide class of sampling plans has an elegant mathematical and computational solution. This is done due to a suitable definition of the optimization problem, which enables to solve it through a linear algebra setting involving eigenvalues and eigenvectors of matrices defined in terms of some population quantities. As a final result, we obtain a very simple and relatively universal method for calculating the subpopulation optimal and equal-precision allocation which is based on one of the most standard algorithms of linear algebra (available, e.g., in R software). Theoretical solutions are illustrated through a numerical example based on the Labour Force Survey. Finally, we would like to stress that the method we describe allows to accommodate quite automatically for different levels of precision priority for subpopulations.     

On Sample Allocation in Multivariate Surveys

The problem of a sample allocation between strata in the case of multiparameter surveys is considered in this article. There are several multivariate sample allocation methods and, moreover, several criteria to deal with in such a case. A maximum coefficient of variation of estimators of the population mean of characters under study is taken as the optimality criterion. This article contains a study on a group of the methods that are easy to implement and do not need complex numerical computation; however, they all are approximate. Five such methods are presented and compared using a simulation study. Finally, it is shown which methods should be considered when designing a survey in which the multivariate sample allocation is to be involved.     

General procedure for estimating the population mean using ranked set sampling

In this paper, we suggest a class of estimators for estimating the population mean ? of the study variable Y using information on X?, the population mean of the auxiliary variable X using ranked set sampling envisaged by McIntyre [A method of unbiased selective sampling using ranked sets, Aust. J. Agric. Res. 3 (1952), pp. 385–390] and developed by Takahasi and Wakimoto [On unbiased estimates of the population mean based on the sample stratified by means of ordering, Ann. Inst. Statist. Math. 20 (1968), pp. 1–31]. The estimator reported by Kadilar et al. [Ratio estimator for the population mean using ranked set sampling, Statist. Papers 50 (2009), pp. 301–309] is identified as a member of the proposed class of estimators. The bias and the mean-squared error (MSE) of the proposed class of estimators are obtained. An asymptotically optimum estimator in the class is identified with its MSE formulae. To judge the merits of the suggested class of estimators over others, an empirical study is carried out.     

Simultaneous estimation of means of two sensitive variables

In this paper, we introduce a new problem of simultaneous estimation of means of two quantitative sensitive variables by using only one randomized response another pseudo response from a respondent in a sample. The proposed estimators are extended to stratified random sampling, and the relative efficiency values are computed for equal, proportional, and optimum allocation with respect to the newly introduced naïve estimators.     

SELECTING THE m POPULATIONS WITH LARGEST MEANS FROM k NORMAL POPULATIONS WITH UNKNOWN VARIANCES

This paper gives a two-sample procedure for selecting the m populations with the largest means from k normal populations with unknown variances. The method is a generalization of a recent work by Ofosu [1973] and hence should find wider practical applications. The experimenter takes an initial sample of preset size N₀ from each population and computes an unbiased estimate of its variance. From this estimate he determines the second sample size for the population according to a table presented for this purpose. The populations associated with the m largest overall sample means will be selected. The procedure is shown to satisfy a confidence requirement similar to that of Ofosu.     

Monitoring Variation in a Multivariate Process When the Dimension is Large Relative to the Sample Size

A control procedure is presented for monitoring changes in variation for a multivariate normal process in a Phase II operation where the subgroup size, m, is less than p, the number of variates. The methodology is based on a form of Wilk' statistic, which can be expressed as a function of the ratio of the determinants of two separate estimates of the covariance matrix. One estimate is based on the historical data set from Phase I and the other is based on an augmented data set including new data obtained in Phase II. The proposed statistic is shown to be distributed as the product of independent beta distributions that can be approximated using either a chi-square or F-distribution. An ARL study of the statistic is presented for a range of conditions for the population covariance matrix. Cases are considered where a p-variate process is being monitored using a sample of m observations per subgroup and m < p. Data from an industrial multivariate process is used to illustrate the proposed technique.