Abstract
In this paper sufficient conditions for the connectedness of certain efficient point sets of convex optimization problems with multiple or random objectives are provided. Known concepts of efficiency like functional efficiency and proper efficiency (with respect to vector optimization problems) as well as efficiency with probability 1 (with respect to stochastic optimization problems with fixed feasible domain) are treated. By this the number of objectives that have to be minimized on the feasible domain (a subset of a Banach-space) can be infinite also.
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 callMore From: Mathematische Operationsforschung und Statistik. Series Optimization
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.
