The present paper presented a new algorithm for solving the subset of the weakly efficient solution of linear multiobjective programming (LVP).

• 摘要给出求解线性多目标规划问题弱有效解子集的一种新算法。