a new approach for solving multi-follower multi-objective linear bilevel programming problems

In this paper, we develop a new approach to solving a class of multi-follower multiobjective linear bilevel programming (mmlbp) problems, wherein each decision maker has multiple objective functions conflicting with each other. we show that the mmlbp problem can be reduced to optimize the top-level multi-objective linear programming problem over the efficientsolutions set of a new molp problem. then, we apply a pareto-filter scheme to find an approximated discrete representation efficient set. a numerical example is presented to show the efficiency of proposed approach.