首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal allocation of stratified samples with several variance constraints and equal workloads over time by geometric programming
Authors:Miles Davis  Robert H Finch Jr
Institution:Social Security Administration , Baltimore, 21235, Maryland
Abstract: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.
Keywords:Neyman allocation  nonlinear mathematical programming  sampling costs  workload constraints  primal and dual problems  convexity  maximization]  Eureka  The Solver?
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号