It will be proved that to every set A of k relatively prime positive integers there corresponds a simplex and a lattice in Euclidean (k-1)-space such that the Frobenius number of A is equal to the covering radius of the simplex with respect to the lattice. It follows that there is a polynomial time algorithm to compute the Frobenius number of a set A of cardinality k.