Abstract
In this paper, the decision problem with multi-objectives is considered, and the nondominated solutions associated with a polyhedral domination cone are discussed. The necessary and sufficient conditions for the solutions are given in the decision space rather than the objective space. The similarity of the solution conditions obtained in this article to the Kuhn-Tucker condition of a convex programming problem is examined. As an application of the solution condition, an algorithm to locate the set of all nondominated solutions is shown for the linear multi-objective decision problem.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
