Another Solution for Some Optimum Allocation Problem
Wojciech W\'ojciak

TL;DR
This paper introduces a new optimality condition-based method, LRNA, for stratified sampling allocation problems, providing a formal proof of its optimality and a practical R implementation.
Contribution
It formulates and proves the optimality of the LRNA procedure for sample allocation with bounds, extending classical methods like Neyman allocation.
Findings
LRNA solves the allocation problem with bounds effectively.
The method is proven optimal using Karush-Kuhn-Tucker conditions.
An R package implementation is available on CRAN.
Abstract
We derive optimality conditions for the optimum sample allocation problem in stratified sampling, formulated as the determination of the fixed strata sample sizes that minimize the total cost of the survey, under the assumed level of variance of the stratified estimator of the population total (or mean) and one-sided upper bounds imposed on sample sizes in strata. In this context, we presume that the variance function is of some generic form that, in particular, covers the case of the simple random sampling without replacement design in strata. The optimality conditions mentioned above will be derived from the Karush-Kuhn-Tucker conditions. Based on the established optimality conditions, we provide a formal proof of the optimality of the existing procedure, termed here as LRNA, which solves the allocation problem considered. We formulate the LRNA in such a way that it also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
