We present an approximate algorithm for calculation of the Chebyshev center for a convex compact subset from R^n which is given via its supporting function. We reduce the problem to the solution of a linear programming problem and estimate the error between an approximate and the exact solutions in terms of the step of a grid.