Some new approaches to discrete stochastic optimization problems

We present three recently developed approaches to solving combinatorially hard stochastic optimization problems: ordinal optimization, a stochastic comparison algorithm, and a stochastic descent algorithm. These, in conjunction with concurrent estimation techniques, are used to provide solutions to a classic buffer allocation problem.