IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v177y2007i2p1074-1089.html
   My bibliography  Save this article

A biobjective method for sample allocation in stratified sampling

Author

Listed:
  • Carrizosa, Emilio
  • Romero Morales, Dolores

Abstract

No abstract is available for this item.

Suggested Citation

  • Carrizosa, Emilio & Romero Morales, Dolores, 2007. "A biobjective method for sample allocation in stratified sampling," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1074-1089, March.
    • Handle: RePEc:eee:ejores:v:177:y:2007:i:2:p:1074-1089
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00017-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Bretthauer, Kurt M. & Ross, Anthony & Shetty, Bala, 1999. "Nonlinear integer programming for optimal allocation in stratified sampling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 667-680, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wright, Tommy, 2017. "Exact optimal sample allocation: More efficient than Neyman," Statistics & Probability Letters, Elsevier, vol. 129(C), pages 50-57.
    2. Carrizosa, Emilio, 2010. "Unequal probability sampling from a finite population: A multicriteria approach," European Journal of Operational Research, Elsevier, vol. 201(2), pages 500-504, March.
    3. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    2. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.
    3. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    4. Calinescu, Melania & Bhulai, Sandjai & Schouten, Barry, 2013. "Optimal resource allocation in survey designs," European Journal of Operational Research, Elsevier, vol. 226(1), pages 115-121.
    5. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    6. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Keskinturk, Timur & Er, Sebnem, 2007. "A genetic algorithm approach to determine stratum boundaries and sample sizes of each stratum in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 53-67, September.
    8. Jirachai Buddhakulsomsiri & Parthana Parthanadee, 2008. "Stratified random sampling for estimating billing accuracy in health care systems," Health Care Management Science, Springer, vol. 11(1), pages 41-54, March.
    9. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    10. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    11. Michael Ludkovski & James Risk, 2017. "Sequential Design and Spatial Modeling for Portfolio Tail Risk Measurement," Papers 1710.05204, arXiv.org, revised May 2018.
    12. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:eee:ejores:v:177:y:2007:i:2:p:1074-1089. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.