Integral Polyhedra in Three Space

Published Online:https://doi.org/10.1287/moor.10.3.403

In a series of recent papers I have introduced a particular class of convex polyhedra in Rn, arising in the study of integer programming problems with n variables. In the present paper a detailed analysis of these polyhedra will be given for the case in which n = 3; the analysis is based on an unpublished theorem demonstrated several years ago by Roger Howe, which seems to have no immediate generalization to higher values of n.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.