An algorithm is given for finding the point of a convex polyhedron in an n-dimensional Euclidean space which is closest to the origin. It is assumed that the convex polyhedron is defined as the convex hull of a given finite set of points. This problem arises when one wishes to determine the direction of steepest descent for certain minimax problems.