Geometric programming
id:
geometric-programming-283-6648520
title:
Geometric programming
text:
A geometric program (GP) is an optimization problem of the form where f 0 , … , f m are posynomials and g 1 , … , g p are monomials. In the context of geometric programming, a monomial is a function from R + + n to R defined as where c > 0 and a i ∈ R . A posynomial is any sum of monomials. Geometric programming is
closely related to convex optimization: any GP can be made convex by means of a change of variables. GPs have numerous applications, including component sizing in IC design, aircraf
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Geometric_programming
date created:
date modified:
2022-10-23T01:18:06Z
main entity:
{"identifier":"Q2078279","url":"https://www.wikidata.org/entity/Q2078279"}
image:
fields total:
13
integrity:
13