Abstract
L E a topological vector space over reals, C a convex cone and X a set in E. C specifies a partial order in E as follows: x, y ∈ E, x ≥ C y if x − y ∈ C. With this order one can define the set of efficient points of X with respect to C as the set Min(X | C) = {x ∈ X: if x ≥ C y for some y ∈ X, then y ≥ C x}. Whenever the relative interior of C, riC, is nonempty, the cone {0} U riC gives another order defining the set of weakly efficient points of X with respect to C, denoted W Min(X | C). One of the most important problems of vector optimization is to investigate topological properties of the sets Min(X | C) and W Min(X | C). Our aim is to develop a new method which makes it possible to prove most important properties of efficient point sets such as contractibility and connectedness in general normed spaces
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.