Abstract

In this paper, we consider the problem of planning the supply of rewards in a Loyalty Reward Program (LRP). We formulate this problem as a two-stage stochastic linear program with simple recourse, and develop a new, sampling-based stochastic optimisation heuristic procedure for solving it. The proposed heuristic is general and can be applied in other contexts as well. Our computational experiments demonstrate the viability of the modelling and solution approaches for solving realistically-sized (large-scale) problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call