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

Nonlinear integer programming for optimal allocation in stratified sampling

Author

Listed:
  • Bretthauer, Kurt M.
  • Ross, Anthony
  • Shetty, Bala

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:116:y:1999:i:3:p:667-680
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00180-5
    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. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    2. H. F. Huddleston & P. L. Claypool & R. R. Hocking, 1970. "Optimal Sample Allocation to Strata Using Convex Programming," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 19(3), pages 273-278, November.
    3. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    4. Kurt M. Bretthauer & Bala Shetty, 1995. "The Nonlinear Resource Allocation Problem," Operations Research, INFORMS, vol. 43(4), pages 670-683, August.
    5. K. S. Srikantan, 1963. "A Problem in Optimum Allocation," Operations Research, INFORMS, vol. 11(2), pages 265-273, April.
    6. Soren S. Nielsen & Stavros A. Zenios, 1992. "Massively Parallel Algorithms for Singly Constrained Convex Programs," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 166-181, May.
    7. Gabriel R. Bitran & Arnoldo C. Hax, 1981. "Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables," Management Science, INFORMS, vol. 27(4), pages 431-441, April.
    8. Mary W. Cooper, 1981. "A Survey of Methods for Pure Nonlinear Integer Programming," Management Science, INFORMS, vol. 27(3), pages 353-361, March.
    9. John M. Mulvey, 1983. "Multivariate Stratified Sampling by Optimization," Management Science, INFORMS, vol. 29(6), pages 715-724, June.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Michael Ludkovski & James Risk, 2017. "Sequential Design and Spatial Modeling for Portfolio Tail Risk Measurement," Papers 1710.05204, arXiv.org, revised May 2018.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.

    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. 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.
    3. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Other publications TiSEM 8b2e0185-36f9-43df-8a3d-d, Tilburg University, School of Economics and Management.
    4. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    5. Lee, Zu-Hsu & Deng, Shiming & Lin, Beixin & Yang, James G.S., 2010. "Decision model and analysis for investment interest expense deduction and allocation," European Journal of Operational Research, Elsevier, vol. 200(1), pages 268-280, January.
    6. Kurt M. Bretthauer & Bala Shetty & Siddhartha Syam, 2003. "A specially structured nonlinear integer resource allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 770-792, October.
    7. Yuji Nakagawa & Ross J. W. James & César Rego & Chanaka Edirisinghe, 2014. "Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models," Management Science, INFORMS, vol. 60(3), pages 695-707, March.
    8. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
    9. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    10. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Discussion Paper 2001-40, Tilburg University, Center for Economic Research.
    11. 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.
    12. 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.
    13. Hezhi Luo & Xianye Zhang & Huixian Wu & Weiqiang Xu, 2023. "Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 199-240, September.
    14. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    15. Reiner Horst, 1990. "Deterministic methods in constrained global optimization: Some recent advances and new fields of application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 433-471, August.
    16. Jamie Fravel & Robert Hildebrand & Laurel Travis, 2024. "Continuous Equality Knapsack with Probit-Style Objectives," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1060-1076, September.
    17. K. C. Kiwiel, 2008. "Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 445-458, March.
    18. 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.
    19. J-J Huang & G-H Tzeng & C-S Ong, 2006. "Choosing best alliance partners and allocating optimal alliance resources using the fuzzy multi-objective dummy programming model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1216-1223, October.
    20. D. Quadri & E. Soutif & P. Tolla, 2009. "Exact solution method to solve large scale integer quadratic multidimensional knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 157-167, February.

    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:116:y:1999:i:3:p:667-680. 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.