Abstract
We show that, given a closed convex set containing the origin in its interior, the support function of the set is the pointwise smallest among all sublinear functions such that
References
- A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli: Maximal lattice-free convex sets in linear subspaces, Math. Oper. Res. 35 (2010) 704–710.https://doi.org/10.1287/moor.1100.0461Google Scholar
- A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli: Minimal inequalities for an infinite relaxation of integer programming, SIAM J. Discrete Math. 24 (2010) 158–168.https://doi.org/10.1137/090756375Google Scholar
- S. S. Dey, L. A. Wolsey: Constrained infinite group relaxations of MIPs, SIAM J. Optim. 20 (2010) 2890–2912.https://doi.org/10.1137/090754388Google Scholar
- E. L. Johnson: Characterization of facets for multiple right-hand side choice linear programs, Math. Program. Study 14 (1981) 112–142.https://doi.org/10.1007/BFb0120925Google Scholar
- J.-B. Hiriart-Urruty, C. Lemaréchal: Fundamentals of Convex Analysis, Springer, Berlin (2001).https://doi.org/10.1007/978-3-642-56468-0Google Scholar
- L. Hörmander: Sur la fonction d’appui des ensembles convexes dans un espace localement convexe, Ark. Mat. 3 (1954) 181–186.https://doi.org/10.1007/BF02589354Google Scholar
- R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton (1969).Google Scholar
- S. Straszewicz: Über exponierte Punkte abgeschlossener Punktemengen, Fundam. Math. 24 (1935) 139–143.https://doi.org/10.4064/fm-24-1-139-143Google Scholar
Suggested citation
Published by Heldermann Verlag, 2011. Rights now held by Banach Press LLC.
