IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v38y2009i16-17p3148-3157.html
   My bibliography  Save this article

On Approximate Optimality of the Sample Size for the Partition Problem

Author

Listed:
  • Tumulesh K. S. Solanky
  • Yuefeng Wu

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.

Suggested Citation

  • Tumulesh K. S. Solanky & Yuefeng Wu, 2009. "On Approximate Optimality of the Sample Size for the Partition Problem," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 38(16-17), pages 3148-3157, October.
    • Handle: RePEc:taf:lstaxx:v:38:y:2009:i:16-17:p:3148-3157
    DOI: 10.1080/03610920902947600
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610920902947600
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610920902947600?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:38:y:2009:i:16-17:p:3148-3157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.