Skip to search formSkip to main contentSkip to account menu

Geometric programming

Known as: GP, Geometric program 
A geometric program (GP) is an optimization problem of the form Minimize subject to where are posynomials and are monomials. In the context of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
An optimization model is presented with a posynomial objective function subject to a fuzzy(relation) equations.Then the structure… 
2005
2005
In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive… 
Review
1977
Review
1977
The paper gives a survey of computational strategies for geometric programming (posynomial and signomial form). It evaluates the… 
1976
1976
The problem of determining the flows (and pressures) in the pipes of a general hydraulic network, for given input and output… 
1972
1972
Kochenberger and Woolsey have introduced slack variables into the constraints of a geometric program and have added their… 
1971
1971
Geometric programming is a mathematical programming technique that is designed to determine the constrained minimum value of a…