Abstract
As we know, the Pareto efficient (optimal) solution or in other words, thenoninferior solution, is a basic concept in multiobjective programming. In thesense of this kind of solution, much theoretical and application work has been doneon solutions in multiobjective programming since the 1950s. However, because thePareto efficient solution is only a solution with respect to a vector objective beingnoinnferior, as for a given multiobjective programming problem, its set is large whenthe number of objectives is great. This is an inevitable flaw caused by definingPareto efficient solution with the partial order induced by a positive cone. Yu intro-duced the nondominated solution on the basis of a general convex cone or domination
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
