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

Trade-off between cost and variance for a multi-objective compromise allocation in stratified random sampling

Author

Listed:
  • Muhamamd Yousaf Shad
  • Ijaz Husain

Abstract

In the present paper, a multi-objective goal optimization mechanism is developed by trading off between cost and variance. Both are adversaries to each other while allocating a sample size even in stratified sampling design. Discussion section shows how these adversaries put their influence on optimal selection. This is a dual optimization procedure in which variance or mean square error is optimized in the first step and then considering some compromise on variance, cost is optimized. The process is applied to both individual and multi-objective programming models.

Suggested Citation

  • Muhamamd Yousaf Shad & Ijaz Husain, 2017. "Trade-off between cost and variance for a multi-objective compromise allocation in stratified random sampling," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(6), pages 2655-2666, March.
    • Handle: RePEc:taf:lstaxx:v:46:y:2017:i:6:p:2655-2666
    DOI: 10.1080/03610926.2015.1040507
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2015.1040507
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2015.1040507?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:46:y:2017:i:6:p:2655-2666. 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.