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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

Designing stratified sampling in economic and business surveys

In most economic and business surveys, the target variables (e.g. turnover of enterprises, income of households, etc.) commonly resemble skewed distributions with many small and few large units. In such surveys, if a stratified sampling technique is used as a method of sampling and estimation, the convenient way of stratification such as the use of demographical variables (e.g. gender, socioeconomic class, geographical region, religion, ethnicity, etc.) or other natural criteria, which is widely practiced in economic surveys, may fail to form homogeneous strata and is not much useful in order to increase the precision of the estimates of variables of interest. In this paper, a stratified sampling design for economic surveys based on auxiliary information has been developed, which can be used for constructing optimum stratification and determining optimum sample allocation to maximize the precision in estimate.     

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.     

Determining the optimal allocation of testing resource for modular software system using dynamic programming

Abstract

Reliability is a major concern in the process of software development because unreliable software can cause failure in the computer system that can be hazardous. A way to enhance the reliability of software is to detect and remove the faults during the testing phase, which begins with module testing wherein modules are tested independently to remove a substantial number of faults within a limited resource. Therefore, the available resource must be allocated among the modules in such a way that the number of faults is removed as much as possible from each of the modules to achieve higher software reliability. In this article, we discuss the problem of optimal resource allocation of the testing resource for a modular software system, which maximizes the number of faults removed subject to the conditions that the amount of testing-effort is fixed, a certain percentage of faults is to be removed and a desired level of reliability is to be achieved. The problem is formulated as a non linear programming problem (NLPP), which is modeled by the inflection S-shaped software reliability growth models (SRGM) based on a non homogeneous Poisson process (NHPP) which incorporates the exponentiated Weibull (EW) testing-effort functions. A solution procedure is then developed using a dynamic programming technique to solve the NLPP. Furthermore, three special cases of optimum resource allocations are also discussed. Finally, numerical examples using three sets of software failure data are presented to illustrate the procedure developed and to validate the performance of the strategies proposed in this article. Experimental results indicate that the proposed strategies may be helpful to software project managers for making the best decisions in allocating the testing resource. In addition, the results are compared with those of Kapur et al. (2004), Huang and Lyu (2005), and Jha et al. (2010) that are available in the literature to deal the similar problems addressed in this article. It reveals that the proposed dynamic programming method for the testing-resource allocation problem yields a gain in efficiency over other methods.     

Selective Maintenance in System Reliability with Random Costs of Repairing and Replacing the Components

In this paper we consider the problem of determining the optimum number of repairable and replaceable components to maximize a system's reliability when both, the cost of repairing the components and the cost of replacement of components by new ones, are random. We formulate it as a problem of non-linear stochastic programming. The solution is obtained through Chance Constrained programming. We also consider the problem of finding the optimal maintenance cost for a given reliability requirement of the system. The solution is then obtained by using Modified E-model. A numerical example is solved for both the formulations.     

Selecting the better binomial population under a budget constraint

The problem of optimal non-sequential allocation of observations for the selection of the better binomial population is considered in the case of fixed sampling costs and budget. With the appropriate choice of selection rule it is shown that a 70% reduction in the probability of incorrect selection is possible by using an unequal rather than equal allocation. Simple formulae are given for the appropriate selection rule and unequal allocation in large samples.     

On stratified bivariate ranked set sampling with optimal allocation for naïve and ratio estimators

The purpose of the current work is to introduce stratified bivariate ranked set sampling (SBVRSS) and investigate its performance for estimating the population mean using both naïve and ratio methods. The properties of the proposed estimator are derived along with the optimal allocation with respect to stratification. We conduct a simulation study to demonstrate the relative efficiency of SBVRSS as compared to stratified bivariate simple random sampling (SBVSRS) for ratio estimation. Data that consist of weights and bilirubin levels in the blood of 120 babies are used to illustrate the procedure on a real data set. Based on our simulation, SBVRSS for ratio estimation is more efficient than using SBVSRS in all cases.