Logarithmic transformation is a method used to change geometric programs into their convex forms. A
geometric program, or GP, is a type of global optimization problem that concerns minimizing a subject to
constraint functions so as to allow one to solve unique non-linear programming problems. All geometric programs
contain functions...