Hu, Yuda; Sun, Erjiang The comparison-number method for finding major optimal solutions and major efficient solutions of the discrete multiobjective programming. (English) Zbl 0789.90066 Syst. Sci. Math. Sci. 6, No. 3, 284-289 (1993). Summary: We introduce a ‘comparison number’ for the relationship of one feasible solution to another. With the help of it a ‘comparison-number method’ for finding major optimal solutions and major efficient solutions to discrete multiobjective programming is given. Cited in 1 Review MSC: 90C29 Multi-objective and goal programming Keywords:Pareto efficient solution; comparison-number method; major optimal solutions; discrete multiobjective programming PDFBibTeX XMLCite \textit{Y. Hu} and \textit{E. Sun}, Syst. Sci. Math. Sci. 6, No. 3, 284--289 (1993; Zbl 0789.90066)