In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as …

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as … website: www.erim.eur.nl A NOTE ON THE DUAL OF AN UNCONSTRAINED (GENERALIZED) GEOMETRIC PROGRAMMING PROBLEM J … (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality …

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as …

–DC converters. First, we revisit some concepts of the optimization technique named geometric programming. Then, we observe that the …

Many global optimization approaches for solving signomial geometric programming problems are based on transformation … integrates the range reduction techniques in a global optimization algorithm for signomial geometric programming to improve … computational efficiency. In the proposed algorithm, the non-convex geometric programming problem is first converted into a convex …

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as …

problem is reformulated as a generalized geometric programming problem. A geometric dual with a linear objective function and … derivative, the geometric programming approach finds better solutions than the previously used discretization method. Copyright …

provide theoretical treatment and to develop efficient algorithms, this problem is reformulated as a generalized geometric … programming problem. A geometric dual with a linear objective function and convex quadratic constraints is derived. A linear … norm for this class of problems, namely, the L <Subscript>1</Subscript> norm of the second derivative, the geometric …