A biobjective method for sample allocation in stratified sampling

The two main and contradicting criteria guiding sampling design are accuracy of estimators and sampling costs. In stratified random sampling, the sample size must be allocated to strata in order to optimize both objectives. In this note we address, following a biobjective methodology, this allocatio...

Descripción completa

Detalles Bibliográficos
Autores: Carrizosa Priego, Emilio José, Romero Morales, María Dolores
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2006
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/107466
Acceso en línea:https://hdl.handle.net/11441/107466
https://doi.org/10.1016/j.ejor.2005.11.027
Access Level:acceso abierto
Palabra clave:Integer programming
Stratified random sampling
Sample allocation
Biobjective integer program
Parametric knapsack problem
Descripción
Sumario:The two main and contradicting criteria guiding sampling design are accuracy of estimators and sampling costs. In stratified random sampling, the sample size must be allocated to strata in order to optimize both objectives. In this note we address, following a biobjective methodology, this allocation problem. A two-phase method is proposed to describe the set of Pareto-optimal solutions of this nonlinear integer biobjective problem. In the first phase, all supported Pareto-optimal solutions are described via a closed formula, which enables quick computation. Moreover, for the common case in which sampling costs are independent of the strata, all Pareto-optimal solutions are shown to be supported. For more general cost structures, the non-supported Pareto-optimal solutions are found by solving a parametric knapsack problem. Bounds on the criteria can also be imposed, directing the search towards implementable sampling plans. Our method provides a deeper insight into the problem than simply solving a scalarized version, whereas the computational burden is reasonable.