Abstract
The notion of separation is extended here to include separation by a cone. It is shown that two closed cones, one of them acute and convex, can be strictly separated by a convex cone, if they have no point in common. As a matter of fact, an infinite number of convex closed acute cones can be constructed so that each of them is a separating cone.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1972.
Bitran, G., andMagnanti, T.,The Structure of Admissible Points with Respect to Cone Dominance, Journal of Optimization Theory and Applications, Vol. 19, pp. 573–614, 1979.
Henig, M. I.,Multicriteria Dynamic Programming, Yale University, New Haven, Connecticut, PhD Dissertation, 1978.
Yu, P. L.,Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–377, 1974.
Stoer, J., andWitzgall, L.,Convexity and Optimization in Finite Dimensions, Vol. 1, Springer-Verlag, Berlin, Germany, 1970.
Author information
Authors and Affiliations
Additional information
Communicated by P. L. Yu
The research was done while the author was a visiting professor at the University of British Columbia, Vancouver, British Columbia, Canada.
Rights and permissions
About this article
Cite this article
Henig, M.I. A cone separation theorem. J Optim Theory Appl 36, 451–455 (1982). https://doi.org/10.1007/BF00934357
Issue Date:
DOI: https://doi.org/10.1007/BF00934357