Prefer a chat interface with context about you and your work?
Fractional programming duality via geometric programming duality
Abstract A duality theory for a class of fractional programs is developed. A fractionalprogram which is non-convex is convexified using a one-to-one transformation. The resulting convex equivalent is then dualized with generalized geometric programming duality.