IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i24p6121-6128.html
   My bibliography  Save this article

An optimal multivariate cluster sampling design

Author

Listed:
  • M. G. M. Khan
  • Mahmood A. Rashid
  • Sushita Sharma

Abstract

This article presents a problem of determining optimum cluster size and sampling units in multivariate surveys. When a cluster sampling design is to be used and more than one characteristic is under study, it is usually not advisable to use the individual optimum cluster size and sampling unit for one reason or the other. In such situations, some criterion is needed to work out an acceptable cluster size and sampling unit which are optimum for all characteristics in some sense. Moreover, for practical implementation of sample size, we need integer values of the cluster size and sampling unit. Therefore, the present article addresses the problem of determining integer optimum compromise cluster size and sampling unit when the population means of the various characteristics are of interest. Formulating the problem as an All Integer Nonlinear Programing Problem (AINLPP), the article develops a solution procedure using a Genetic algorithm. The compromise solution discussed is the optimal in the sense that it minimizes a weighted sum of the variances of the cluster sample means of various characteristics under study. Two numerical examples illustrate the practical application of the solution procedure. The results show that the proposed technique can be efficiently applied in determining the sample size in multivariate cluster sampling design.

Suggested Citation

  • M. G. M. Khan & Mahmood A. Rashid & Sushita Sharma, 2020. "An optimal multivariate cluster sampling design," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(24), pages 6121-6128, December.
  • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:24:p:6121-6128
    DOI: 10.1080/03610926.2019.1626430
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1626430
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2019.1626430?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:49:y:2020:i:24:p:6121-6128. 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.