Cutting plane method for multiple objective stochastic integer linear programming

This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer linear program (MOILP), a cutting plane technique may be used to compute all the efficient solutions of the last model leaving the decision maker to choose a solution according to his preferences. A numerical example is also included for illustration.