Composite geometric programming
type: Item
instance of: scholarly article
title: Composite geometric programming
zbMATH Open document ID: 0666.90061
DOI: 10.1007/BF00940025
author: S. H. Smith
published in: Journal of Optimization Theory and Applications
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 4091190
zbMATH Keywords: posynomials
zbMATH Keywords: composition of an exponential and a linear function
zbMATH Keywords: exponential and a convex function
zbMATH Keywords: duality theory
zbMATH Keywords: composite geometric programming
MaRDI profile type: Publication
cites work: A MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
cites work: A FURTHER MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
cites work: Q5557595
cites work: Generalized Polynomial Optimization
cites work: Geometric Programming
cites work: Transcendental geometric programs
cites work: Quadratic geometric programming with application to machining economics
cites work: Q4113605
cites work: Geometric Programming: Methods, Computations and Applications
cites work: Convex Analysis
description: scientific article; zbMATH DE number 4091190