Multiobjective two-level simple recourse programming problems with discrete random variables

Abstract

In this paper, we focus on multiobjective two-level simple recourse programming problems, in which multiple objective functions are involved in each level, shortages and excesses arising from the violation of the constraints with discrete random variables are penalized, and the sum of the objective function and the expectation of the amount of the penalties is minimized. To deal with such problems, a concept of Pareto Stackelberg solutions based on the reference objective levels is introduced. Using the Kuhn–Tucker approach in two-level programming, we formulate as a mixed integer programming problem, and propose an interactive algorithm to obtain a satisfactory solution of the leader from among a Pareto Stackelberg solution set based on the reference objective levels. A numerical example illustrates the proposed algorithm for a multiobjective two-level stochastic programming problem with simple recourses under the hypothetical leader.