For the solution of the standard complementary geometric programming min x1, (1) s. t. p_m(x)/Q_m(x)≤1 (m = 1,2,…,M) x > 0where P_m(x) and Q_m(x)(m = 1, 2,…, M) are all posynomials of x = (x_1,…,x_n)~T, analgorithm was given in [6]. Let x~* be any limit point of the point sequence generated bythis algorithm, by assuming that one certain posynomial geometric programming associated withx~* is superconsistent, we prove that x~* is a Kuhn-Tucker point of (1).