Abstract
In multiple-objective programming, a knowledge of the structure of the non-dominated set can aid in generating efficient solutions. We present new concepts which allow for a better understanding of the structure of the set of non-dominated solutions for non-convex bicriteria programming problems. In particular, a means of determining whether or not this set is connected is examined. Both supersets and newly defined subsets of the non-dominated set are utilized in this investigation. Of additional value is the use of the lower envelope of the set of outcomes in classifying feasible points as (properly) non-dominated solutions.
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.
