Article ID: | iaor19971568 |
Country: | United Kingdom |
Volume: | 5 |
Issue: | 3 |
Start Page Number: | 232 |
End Page Number: | 243 |
Publication Date: | Sep 1996 |
Journal: | Journal of Multi-Criteria Decision Analysis |
Authors: | Wiecek Malgorzata M., Tenhuisen Matthew L. |
In multiple-objective programming, a knowledge of the structure of the non-dominated set can aid in generating efficient solutions. This paper presents 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.