Solving a class of geometric programming problems by an efficient dynamic model

► The main idea is to convert the GP problem into an equivalent convex optimization problem. ► A dynamic model for solving the obtained convex optimization problem is proposed. ► The proposed dynamic model is proved to be stable in the sense of Lyapunov. ► The model is globally convergent to an exact optimal solution of the GP problem. ► The validity of the model is demonstrated by using several examples.