🌙

拉格朗日可分解多目标优化问题中的一种新帕累托最优解

A New Pareto Optimal Solution in a Lagrange Decomposable Multi-Objective Optimization Problem

Journal of the Operational Research Society · 1991
被引 0
ABS 3

中文导读

研究了一个凸拉格朗日可分解多目标优化问题的委员会决策过程,提出了“偏好均衡集”这一新解概念,并探讨了非帕累托最优的偏好均衡点如何推广帕累托最优概念。

Abstract

In this paper a committee decision-making process of a convex Lagrange decomposable multi-objective optimization problem, which has been decomposed into various subproblems, is studied. Each member of the committee controls only one subproblem and attempts to select the optimal solution of this subproblem most desirable to him, under the assumption that all the constraints of the total problem are satisfied. This procedure leads to a new solution concept of a Lagrange decomposable multi-objective optimization problem, called a preferred equilibrium set. A preferred equilibrium point of a problem, for a committee, may or may not be a Pareto optimal point of this problem. In some cases, a non-Pareto optimal preferred equilibrium point of a problem, for a committee, can be considered as a special type of Pareto optimal point of this problem. This fact leads to a generalization of the Pareto optimality concept in a problem.

数学优化帕累托最优拉格朗日乘子多目标优化决策理论