Two theorems for relations between the major efficient solutions and major optimal solutions of multiobjective programming problem and the Pareto efficient solutions and Pareto weakly efficient solutions of major objectives programming problems are proved.
证明了多目标规划问题的较多有效解和较多最优解与有关较多个分目标问题的Ｐａｒｅｔｏ有效解和Ｐａｒｅｔｏ弱有效解之间关系的两个基本定
With the help of them, we have defined s-major efficient solution, s-weakly major efficient solution, s-major optimal solution and .
借助偏爱目标数意义下的序,定义了多目标 规划的s-较多有效解、s-弱较多有效解、s-较多最优解和s-严格较多最优解,研究了它们之间的关系,以及它们 与Pareto有效解、Pareto弱有效解、较多有效解和较多最优解等关系。
