Bileval and Multiobjectives Decision Making with Stackelberg Game
基于Stackelberg对策的两层多目标决策

The problems of bileval and multiobjective decision making (BLMOP) which is defined by Stackalberg game are studied. Its feasible domain and solution set are described via the cone extreme points. Based on the discussion of its behavior of it, this paper presents a new interactive BLMOP algorithm. Examples show the feasibility of the proposed algorithm.