Abstract
This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objective optimization problem using characterizations of the sets of (strictly, weakly) efficient solutions of unconstrained multi-objective optimization problems. We demonstrate the usefulness of the results by applying it on constrained multi-objective location problems. Using our new results we show that special classes of constrained multi-objective location problems (e.g., point-objective location problems, Weber location problems, center location problems) can be completely solved with the help of algorithms for the unconstrained case.
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.
