作者: Hong Yan , Quanling Wei , Jun Wang
DOI: 10.1016/J.JMAA.2004.08.069
关键词:
摘要: It is not a difficult task to find weak Pareto or solution in multiobjective linear programming (MOLP) problem. The difficulty lies finding all these solutions and representing their structure. This paper develops an algorithm for solving this We investigate the relationships objective space. determines finite number of weights, each which corresponds weighted sum problems. By problems, we further obtain MOLP structure constraint avoids degeneration problem, major hurdle previous works, presents easy clear