IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i3p381-395.html
   My bibliography  Save this article

On Optimal Allocation of Indivisibles Under Uncertainty

Author

Listed:
  • Vladimir I. Norkin

    (International Institute for Applied Systems Analysis, Laxenburg, Austria)

  • Yuri M. Ermoliev

    (International Institute for Applied Systems Analysis, Laxenburg, Austria)

  • Andrzej Ruszczyński

    (International Institute for Applied Systems Analysis, Laxenburg, Austria)

Abstract

The optimal allocation of indivisible resources is formalized as a stochastic optimization problem involving discrete decision variables. A general stochastic search procedure is proposed, which develops the concept of the branch-and-bound method. The main idea is to process large collections of possible solutions and to devote more attention to the most promising groups. By gathering more information to reduce the uncertainty and by narrowing the search area, the optimal solution can be found with probability one. Special techniques for calculating stochastic lower and upper bounds are discussed. The results are illustrated by a computational experiment.

Suggested Citation

  • Vladimir I. Norkin & Yuri M. Ermoliev & Andrzej Ruszczyński, 1998. "On Optimal Allocation of Indivisibles Under Uncertainty," Operations Research, INFORMS, vol. 46(3), pages 381-395, June.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:3:p:381-395
    DOI: 10.1287/opre.46.3.381
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.3.381
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.3.381?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
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Schultz, R. & Stougie, L. & Van Der Vlerk, M., 1993. "Two-Stage Stochastic Integer Programming. A Survey," Papers 520, Groningen State, Institute of Economic Research-.
    2. T. W. Edward Lau & Y. C. Ho, 1997. "Universal Alignment Probabilities and Subset Selection for Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 93(3), pages 455-489, 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. Eun, Joonyup & Kim, Sang-Phil & Yih, Yuehwern & Tiwari, Vikram, 2019. "Scheduling elective surgery patients considering time-dependent health urgency: Modeling and solution approaches," Omega, Elsevier, vol. 86(C), pages 137-153.
    2. Kabli, Mohannad & Quddus, Md Abdul & Nurre, Sarah G. & Marufuzzaman, Mohammad & Usher, John M., 2020. "A stochastic programming approach for electric vehicle charging station expansion plans," International Journal of Production Economics, Elsevier, vol. 220(C).
    3. Sigurdur Ólafsson, 2004. "Two-Stage Nested Partitions Method for Stochastic Optimization," Methodology and Computing in Applied Probability, Springer, vol. 6(1), pages 5-27, March.
    4. Walter Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    5. Sigrún Andradóttir & Andrei A. Prudius, 2009. "Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 193-208, May.
    6. Gutjahr, W. J. & Hellmayr, A. & Pflug, G. Ch., 1999. "Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound," European Journal of Operational Research, Elsevier, vol. 117(2), pages 396-413, September.
    7. Walter J. Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    8. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2004. "Selecting the best stochastic system for large scale problems in DEDS," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 64(2), pages 237-245.
    9. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    10. B.J. Lence & A. Ruszczynski, 1996. "Managing Water Quality under Uncertainty: Application of a New Stochastic Branch and Bound Method," Working Papers wp96066, International Institute for Applied Systems Analysis.
    11. Mahmoud H. Alrefaei & Sigrún Andradóttir, 2005. "Discrete stochastic optimization using variants of the stochastic ruler method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 344-360, June.
    12. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    13. Sushil R. Poudel & Md Abdul Quddus & Mohammad Marufuzzaman & Linkan Bian & Reuben F. Burch V, 2019. "Managing congestion in a multi-modal transportation network under biomass supply uncertainty," Annals of Operations Research, Springer, vol. 273(1), pages 739-781, February.
    14. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    15. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Usher, John M. & Jaradat, Raed, 2018. "A collaborative energy sharing optimization model among electric vehicle charging stations, commercial buildings, and power grid," Applied Energy, Elsevier, vol. 229(C), pages 841-857.
    16. K. Haeggloef, 1996. "The Implementation of the Stochastic Branch and Bound Method for Applications in River Basin Water Quality Management," Working Papers wp96089, International Institute for Applied Systems Analysis.
    17. W. J. Gutjahr & C. Strauss & E. Wagner, 2000. "A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 125-135, May.

    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. S.-C. Horng & S.-Y. Lin, 2009. "Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 213-231, February.
    2. Junjie Jia & Nan Yang & Chao Xing & Haoze Chen & Songkai Liu & Yuehua Huang & Binxin Zhu, 2019. "An Improved Constrained Order Optimization Algorithm for Uncertain SCUC Problem Solving," Energies, MDPI, vol. 12(23), pages 1-19, November.
    3. S.Y. Lin & Y.C. Ho, 2002. "Universal Alignment Probability Revisited," Journal of Optimization Theory and Applications, Springer, vol. 113(2), pages 399-407, May.
    4. M.S. Yang & L.H. Lee, 2002. "Ordinal Optimization with Subset Selection Rule," Journal of Optimization Theory and Applications, Springer, vol. 113(3), pages 597-620, June.
    5. Q. C. Zhao & Y. C. Ho & Q. S. Jia, 2005. "Vector Ordinal Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(2), pages 259-274, May.

    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:inm:oropre:v:46:y:1998:i:3:p:381-395. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.