A synchronous reference point‐based interactive method for stochastic multiobjective programming

Stochastic multiobjective programming models are highly complex problems, due to the presence of random parameters, together with several conflicting criteria that have to be optimized simultaneously. Even the widely used concept of efficiency has to be redefined for these problems. The use of interactive procedures can somehow ease this complexity, allowing the decision maker to learn about the problem itself, and to look for his most preferred solution. Reference point schemes can be adapted to stochastic problem, by asking the decision maker to provide, not only desirable levels for the objectives, but also the desired probability to achieve these values. In this paper, we analyze the different kinds of achievement scalarizing functions that can be used in this environment, and we study the efficiency (in the stochastic sense) of the different solutions obtained. As a result, a synchronous interactive method is proposed for a class of stochastic multiobjective problems, where only the objective functions are random. Several solutions can be generated by this new method, making use of the same preferential information, using the different achievement scalarizing functions. The preferential information (levels and probabilities for the objectives) is incorporated into the achievement scalarizing functions in a novel way to generate the new solutions. The special case of linear normal problems is addressed separately. The performance of the algorithm is illustrated with a numerical example.