In this paper we study Minkowski duality, i.e. the correspondence between sublinear functions and closed convex sets in the context of dual pairs of vector spaces.
Under a class of generalized (Type I, F, ρ)-convexity assumptions, the author formulates the sufficient conditions about Pareto efficiency and Geoffrion proper efficiency and gets the dual results between multiobjective programming and its Wolfe dual.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Let X be a real locally convex linear topological space. A functional f : X → lR is called sublinear provided that f is subadditive and f(nx) = nf(x),x ∈ X,n ∈ IN. We establish a one-to-one correspondence between the collectron of all sublinear functional satisfying some mild regularity conditions and the family of all nonempty convex and weakly"- compact subsets of the dual space X*.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.