资 源 简 介
给出求解线性多目标规划问题弱有效解子集的一种新算法．在不同的条件下，运用此
算法得到了线性多目标规划的弱有效解子集，并在得到的解子集中再次进行寻优，进而得到
弱有效解集中决策者满意的较优解；同时用ＶＣ＋＋语言实现了此算法，并给出了具体算例．
-Given for solving linear multiobjective programming weakly efficient solution of a subset of the new algorithm. Under different conditions, using this algorithm is a linear multi-objective planning for a subset of weakly efficient solution, and in the solution subset of re-optimization, and then weakly efficient solution to be satisfied with the focus on decision-makers better solution at the same time using VC language realize this algorithm, and gives a specific example.
