Discrete-valued, stochastic-constrained simulation optimization with COMPASS

We propose an improvement in the random search algorithm called COMPASS to allow it to deal with a single stochastic constraint. Our algorithm builds on two ideas: (a) a novel simulation allocation rule and (b) the proof that this new simulation allocation rule does not affect the asymptotic local convergence of the COMPASS algorithm. It is shown that the stochastic-constrained COMPASS has a competitive performance in relation to other well known algorithms found in the literature for discrete-valued, stochastic-constrained simulation problems.