Composite geometric programming

From MaRDI portal





Geometric programming is based on functions called posynomials, the terms of which are log-linear. This class of programs is extended from the composition of an exponential and a linear function to an exponential and a convex function. The resulting duality theory for composite geometric programs retains many of the qualities of geometric programming duality, while at the same time encompassing new areas of application. As an application, composite geometric programming is applied to exponential geometric programming. A pure dual is developed for the first time and used to solve a problem from the literature.











This page was built for publication: Composite geometric programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117141)