Composite geometric programming
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.
- A FURTHER MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- A MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- Convex Analysis
- Generalized Polynomial Optimization
- Geometric Programming
- Geometric Programming: Methods, Computations and Applications
- scientific article; zbMATH DE number 3537446 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Quadratic geometric programming with application to machining economics
- Transcendental geometric programs
- On a compound duality classification for geometric programming
- Posynomial geometric programming as a special case of semi-infinite linear programming
- scientific article; zbMATH DE number 4164563 (Why is no real title available?)
- scientific article; zbMATH DE number 3945888 (Why is no real title available?)
- Non-standard posynomial geometric programs
- Composite convex programs
- Stochastic tool management via composite geometric programming
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)