Computational Aspects of Optimal Allocation in Multivariate Stratified Sampling

We consider the problem of extending the Neyman allocation--which minimizes total sampling cost in stratified random sampling subject to an upper bound on the variance of a single estimated population total--the same situation with more than just one variance constraint. We deal with a series of com...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on scientific and statistical computing Vol. 4; no. 2; pp. 322 - 329
Main Author Causey, Beverley D.
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.06.1983
Subjects
Approximation
Neighborhoods
Population
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of extending the Neyman allocation--which minimizes total sampling cost in stratified random sampling subject to an upper bound on the variance of a single estimated population total--the same situation with more than just one variance constraint. We deal with a series of computational aspects of solving this problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0196-5204
1064-8275
2168-3417
1095-7197
DOI:10.1137/0904026