An algorithm for finding the Chebyshev center of a finite point set in the Euclidean space R(n) is proposed. The algorithm terminates after a finite number of iterations. In each iteration of the algorithm the current point is projected orthogonally onto the convex hull of a subset of the given point set.