Abstract
AbstractIn this paper we study a multiple‐objective dispersion problem from an efficient solution and value function perspective. A general fundamental theorem on non‐dominance is given and a polar co‐ordinate elimination heuristic is given for the case of R2. Some general results are given for the existence of a linearly weighted objective function whose maximal value will give a most preferred solution, for convex or concave value functions, and a heuristic is developed for the case where these conditions do not hold.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.