Abstract
The following result is proved using solvability and optimality criteria for linear programs. The duals to the cones of feasible directions at vertices of a polyhedral set constitute a partition of the dual to the recession cone of the set.
This is a preview of subscription content, log in via an institution to check access.
References
A.D. Alexandrov,Convex polyhedra (in Russian, GITTL, Moscow, 1950) pp. 44–45.
R.V. Benson,Euclidean geometry and convexity (McGraw-Hill, New York, 1966) p. 143.
L.A. Santalo,Integral geometry and geometric probability (Addison-Wesley, Reading, MA, 1976) p. 7.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions (Springer, Berlin, 1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Epelman, M.S. On a property of polyhedral sets. Mathematical Programming 16, 371–373 (1979). https://doi.org/10.1007/BF01582121
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582121