Solution to geometric programming problems by transformation to convex programming problems

Abstract Structural optimization problems which can be transformed to geometric programming problems can be easily solved by a further simple transformation to convex programming problems. Non-zero degree of difficulty geometric programming problems can be solved as easily as those with zero degree of difficulty.