![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
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.