This paper addresses a geometric programming problem, where the objective function and constraints are interval-valued functions. The concept of acceptable feasible region is introduced, and a methodology is developed to transform this model to a general optimization problem, which is free from interval uncertainty. Relationship between the solution of the original problem and the transformed problem is established. The methodology is illustrated through numerical examples. Solutions by the proposed method and previous methods are analyzed.