부산대학교 도서관

Let $\scr L$ be a bounded convex polyhedron in $R_3$ determined by a system of linear inequalities. An integer point $(x_0,y_0,z_0)\in\scr L$ is said to be upper [lower] with respect to $z$ if $(x_0,y_0,z_0+1)\not\in\scr L\ [(x_0,y_0,z_0-1)\not\in\scr L]$. The set of all upper and lower integer points is called the set of all extreme integer points of $\scr L$. An algorithm for finding all extreme points of $\scr L$ is presented and a numerical example is given.