This paper gives an efficient method for solving positive coefficient geometric programming with manydegrees of difficulty.First of all the geometric programrning with D degree of difficulty is transformed into lin-ear programming with a D-dimensional and then into one-dimensional searching problem.The result showsthat this method is efficient.