A strong product graph is denoted by G1 ⊠G2, where G1 and G2 are called its factor graphs. This paper gives the range of the minimum strong radius of the strong product graph. And using the relationship between the cartesian product graph G1 ×G2 and the strong product graph G1 ⊠G2, another different upper bound of the minimum strong radius of the strong product graph is given.