EconPapers    
Economics at your fingertips  
 

On Approximate Optimality of the Sample Size for the Partition Problem

Tumulesh K. S. Solanky and Yuefeng Wu

Communications in Statistics - Theory and Methods, 2009, vol. 38, issue 16-17, 3148-3157

Abstract: We consider the problem of partitioning a set of normal populations with respect to a control population into two disjoint subsets according to their unknown means. For the purely sequential procedure of Solanky and Wu (2004) which can take c (≥1) observations from the control population at each sampling step, an approximate optimal sampling strategy is derived in order to minimize the total sampling cost. The obtained methodology is easy to implement and it depends only on the sampling costs and the number of populations to be partitioned. More importantly, it does not depend on the design parameters and the unknown parameters. The performance of the obtained optimal strategy is studied via Monte Carlo simulations to investigate the role of unknown parameters and the design parameters on the derived optimality. An example is provided to illustrate the derived optimal allocation strategy.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610920902947600 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:38:y:2009:i:16-17:p:3148-3157

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610920902947600

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:lstaxx:v:38:y:2009:i:16-17:p:3148-3157