In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and convex and in...

Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class...