Geometric programming problem is an important optimization technique which is commonly used for solving various types of nonlinear optimization problems and engineering problems. Geometric programming models that are commonly used generally based on deterministic and accurate parameters. In the real-world geometric programming problems, it has been observed that the parameters are frequently inaccurate and ambiguous. In this paper, we have considered chance constrained geometric programming problem with uncertain coefficients with geometric programming technique in the uncertain based framework. We have shown that the associated chance constrained uncertain geometric programming problem can be converted into crisp geometric programming problem by using triangular and trapezoidal uncertainty distributions for the uncertain variables. The main aim of this paper is to provide the solution procedure of geometric programming under triangular and trapezoidal uncertainty distribution. Two numerical examples are demonstrated to validate the efficiency of the procedures and algorithms.