Global Algorithm And α-degree Joint Efficient Solution For Group Multiobjective Optimization Problems

Group multi-objective programming is an interface field between group decision-making and multiobjective programming. It illustrates the complex decision decision-making process in the form of integrating the quantity of models, thus demonstrating better application outlook in modern key social decision-making.In the first chapter of this work, the historical background and main research contents about group decision-making, multi-objective optimization, and group multi-objective decision-making are introduced. The following chapters consists mostly five parts, which are:(1) chapter2introduces the group multi-objective optimization problems (GMP) group consistent Pareto (weak) efficient solution of the definition and related properties, theorem, justice, and the solution is analyzed, and the definition of the nature and the theorem is proved.(2) The third chapter introduces group multiobjective optimization problems (GMP) joint efficient solution of the definition and analysis.(3) chapter4based on the decision maker’s important degree, and given the new definition of efficient solution, that is α-degree joint efficient solution for group multiobjective optimization problems. and obtained optimality necessary condition for group multiobjective optimization problems.(4) chapter5given the new definition of efficient solution again, that is Weighting procedures α-degree joint efficient solution for group multiobjective optimization problems. and obtained optimality necessary condition for group multiobjective optimization problems.(5) chapter6given a α-degree joint efficient number method for solving group multiobjective optimization problems.