solving a signomial geometric programming problem and it’s application in optimization of industrial designs

This study processes a method for solving mixed integer signomial geometric programming (misgp) problems which are broadly applied in industrial designs. in this work, firstly we introduce a signomial geometric programming problem in general, which is a sort of non-linear programming problems, then we use a convex relaxation to reach a global solution using this process, leads us to get a better objective function value than non-convex initial problem. finally, a real designing example is included to demonstrate the correctness and efficiency of the proposed approach.