On Optimal Allocation of Indivisibles Under Uncertainty

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.

[1]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[2]  George B. Dantzig,et al.  Parallel processors for planning under uncertainty , 1990 .

[3]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[4]  Karl Frauendorfer.  An Illustrative Survey of Existing Approaches in Stochastic Two-Stage Programming , 1992 .

[5]  T. Lai.  Adaptive treatment allocation and the multi-armed bandit problem , 1987 .

[6]  Maarten Hendrikus van der Vlerk.  Stochastic programming with integer recourse , 1995 .

[7]  Leen Stougie.  Design and analysis of algorithms for stochastic integer programming , 1987 .

[8]  Leen Stougie,et al.  Approximation in Stochastic integer programming , 2003 .

[9]  H. Peyton Young.  Dividing the Indivisible , 1995 .

[10]  Gerd Infanger,et al.  Monte Carlo (importance) sampling within a benders decomposition algorithm for stochastic linear programs , 1991, Ann. Oper. Res..

[11]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[12]  V. Dupac,et al.  Stochastic approximation on a discrete set and the multi-armed bandit problem , 1982 .

[13]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[14]  R. Schultz,et al.  Two-stage stochastic integer programming : a survey , 1996 .

[15]  Z. Tang.  Adaptive partitioned random search to global optimization , 1994, IEEE Trans. Autom. Control..

[16]  Sigrún Andradóttir,et al.  A Global Search Method for Discrete Stochastic Optimization , 1996, SIAM J. Optim..

[17]  R. Wets,et al.  Stochastic programming , 1989 .

[18]  T. W. E. Lau,et al.  Universal Alignment Probabilities and Subset Selection for Ordinal Optimization , 1997 .

[19]  B. J. Lageweg,et al.  Stochastic integer programming by dynamic programming , 1985 .

[20]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..