线性多目标极小化最佳调和解的逼近理想解方法

The Approximate Ideal-Points Method of the Best Compromise Solution for Linear Multiobjective Minimization

本文对线性多目标极小化问题,提出一种最佳调和解的逼近理想解方法。它具有求解过程保持线性、几何意义清晰、不需要迭代计算的优点,算例表明它是有效、简便的。

In this paper,we present the approximate ideal-points method of the best compromise solution for linear multiobjective minimization. The finding solution procedure is linear,the geometric sense is clear and It does not require computation